automata theoryThe finiteness of the list of quadruples of instructions leads to the idea that all Turing machines can be listed—that is, they are at most countable in number. This being the case, it can be proved that there is what Turing called a “universal” machine capable of operating like any given Turing machine. For a given partial recursive function of a single argument, there is a...
model theory...According to a central discovery made in 1963 by the American mathematician Michael Morley, if a theory is categorical in any uncountable cardinality (i.e., any cardinality higher than the countable), then it is categorical in every uncountable cardinality. On the other hand, examples are known for all four combinations of countable and uncountable cardinalities: specifically, there...
set theory...to occupy him more and more. He began to discover unexpected properties of sets. For example, he could show that the set of all algebraic numbers, and a fortiori the set of all rational numbers, is countable in the sense that there is a one-to-one correspondence between the integers and the members of each of these sets by means of which for any member of the set of algebraic numbers (or...The symbol ℵ0 (aleph-null) is standard for the cardinal number of N (sets of this cardinality are called denumerable), and ℵ (aleph) is sometimes used for that of the set of real numbers. Then n < ℵ0 for each n ∊ N and ℵ0 < ℵ.
Simply begin typing or use the editing tools above to add to this article.
Once you are finished and click submit, your modifications will be sent to our editors for review.