Results 251 to 260 of about 7,281,853 (299)
Some of the next articles are maybe not open access.
Notre Dame Journal of Formal Logic, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Damián Enrique Szmuc +1 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Damián Enrique Szmuc +1 more
openaire +2 more sources
Nature, 2003
In creating the mitotic spindle and the contractile ring, natural selection has engineered fascinating precision machines whose movements depend upon forces generated by ensembles of cytoskeletal proteins. These machines segregate chromosomes and divide the cell with high fidelity.
Jonathan M, Scholey +2 more
openaire +2 more sources
In creating the mitotic spindle and the contractile ring, natural selection has engineered fascinating precision machines whose movements depend upon forces generated by ensembles of cytoskeletal proteins. These machines segregate chromosomes and divide the cell with high fidelity.
Jonathan M, Scholey +2 more
openaire +2 more sources
On Polynomials and Divisibility
The American Mathematical Monthly, 2012A divisibility condition, together with some kind of boundedness, ensure that a function f : ℤ → ℤ is a polynomial function.
Michael Dorfling, Johan Meyer
openaire +1 more source
On a branching model of division-within-division
Mathematical Medicine and Biology, 1999We consider a deterministic version of a stochastic model for division-within-division processes described by Kimmel (1997, In: Proceedings of the IMA Workshop 'Classical and Modern Branching Processes' (K. Arthreya and P. Jagers, eds.)???? :????). It is shown that the behaviour of the deterministic model can be analyzed by using an associated Markov ...
openaire +3 more sources
Journal of Algebra and Its Applications, 2005
A divisibility test of Arend Heyting, for polynomials over a field in an intuitionistic setting, may be thought of as a kind of division algorithm. We show that such a division algorithm holds for divisibility by polynomials of content 1 over any commutative ring in which nilpotent elements are zero.
openaire +2 more sources
A divisibility test of Arend Heyting, for polynomials over a field in an intuitionistic setting, may be thought of as a kind of division algorithm. We show that such a division algorithm holds for divisibility by polynomials of content 1 over any commutative ring in which nilpotent elements are zero.
openaire +2 more sources
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979
We study the power of RAM acceptors with several instruction sets. We exhibit several instances where the availability of the division operator increases the power of the acceptors. We also show that in certain situations parallelism and stochastic features ('distributed random choices') are provably more powerful than either parallelism or randomness ...
openaire +1 more source
We study the power of RAM acceptors with several instruction sets. We exhibit several instances where the availability of the division operator increases the power of the acceptors. We also show that in certain situations parallelism and stochastic features ('distributed random choices') are provably more powerful than either parallelism or randomness ...
openaire +1 more source
Division systems and division spaces
1991Abstract Generalized Riemann and variational integration theory connect a base space T of points of some kind, a space K of values, and three structures, (a) division systems and division spaces in T, (b) the algebra of K, (c) a topology or an order in K to define limits.
openaire +1 more source
Division of Powers or Division of Labor?
Soviet Law and Government, 1967One might think that the history of governmental development has answered this question. Elements of the doctrine of division of powers may be found even in Aristotle. This doctrine was supported by Marsilius of Padua, John Locke and others, but it was Montesquieu who stated it most clearly.
openaire +1 more source
|˜-divisibility of ultrafilters.
Ann. Pure Appl. Log., 2021We further investigate a divisibility relation on the set βN of ultrafilters on the set of natural numbers. We single out prime ultrafilters (divisible only by 1 and themselves) and establish a hierarchy in which a position of every ultrafilter depends on the set of prime ultrafilters it is divisible by.
openaire +2 more sources