|
Von Neumann Universe
In set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted by ''V'', is the class of hereditary well-founded sets. This collection, which is formalized by Zermelo–Fraenkel set theory (ZFC), is often used to provide an interpretation or motivation of the axioms of ZFC. The concept is named after John von Neumann, although it was first published by Ernst Zermelo in 1930. The rank of a well-founded set is defined inductively as the smallest ordinal number greater than the ranks of all members of the set. In particular, the rank of the empty set is zero, and every ordinal has a rank equal to itself. The sets in ''V'' are divided into the transfinite hierarchy ''Vα'', called the cumulative hierarchy, based on their rank. Definition The cumulative hierarchy is a collection of sets ''V''α indexed by the class of ordinal numbers; in particular, ''V''α is the set of all sets having ranks less than α. Thus there is one set ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Set Theory
Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory. The non-formalized systems investigated during this early stage go under the name of '' naive set theory''. After the discovery of paradoxes within naive set theory (such as Russell's paradox, Cantor's paradox and the Burali-Forti paradox) various axiomatic systems were proposed in the early twentieth century, of which Zermelo–Fraenkel set theory (with or without the axiom of choice) is still the best-known and most studied. Set theory is commonly employed as a foundational ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Von Neumann Universe 4
The term ''von'' () is used in German language surnames either as a nobiliary particle indicating a noble patrilineality, or as a simple preposition used by commoners that means ''of'' or ''from''. Nobility directories like the ''Almanach de Gotha'' often abbreviate the noble term ''von'' to ''v.'' In medieval or early modern names, the ''von'' particle was at times added to commoners' names; thus, ''Hans von Duisburg'' meant "Hans from he city ofDuisburg". This meaning is preserved in Swiss toponymic surnames and in the Dutch or Afrikaans ''van'', which is a cognate of ''von'' but does not indicate nobility. Usage Germany and Austria The abolition of the monarchies in Germany and Austria in 1919 meant that neither state has a privileged nobility, and both have exclusively republican governments. In Germany, this means that legally ''von'' simply became an ordinary part of the surnames of the people who used it. There are no longer any legal privileges or constraints assoc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Set Of All Sets
In set theory, a universal set is a set which contains all objects, including itself. In set theory as usually formulated, it can be proven in multiple ways that a universal set does not exist. However, some non-standard variants of set theory include a universal set. Reasons for nonexistence Many set theories do not allow for the existence of a universal set. There are several different arguments for its non-existence, based on different choices of axioms for set theory. Regularity In Zermelo–Fraenkel set theory, the axiom of regularity and axiom of pairing prevent any set from containing itself. For any set A, the set \ (constructed using pairing) necessarily contains an element disjoint from \, by regularity. Because its only element is A, it must be the case that A is disjoint from \, and therefore that A does not contain itself. Because a universal set would necessarily contain itself, it cannot exist under these axioms. Russell's paradox Russell's paradox prevents the ex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Morse–Kelley Set Theory
In the foundations of mathematics, Morse–Kelley set theory (MK), Kelley–Morse set theory (KM), Morse–Tarski set theory (MT), Quine–Morse set theory (QM) or the system of Quine and Morse is a first-order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory restricts the bound variables in the schematic formula appearing in the axiom schema of Class Comprehension to range over sets alone, Morse–Kelley set theory allows these bound variables to range over proper classes as well as sets, as first suggested by Quine in 1940 for his system ML. Morse–Kelley set theory is named after mathematicians John L. Kelley and Anthony Morse and was first set out by and later in an appendix to Kelley's textbook ''General Topology'' (1955), a graduate level introduction to topology. Kelley said the system in his book was a variant of the systems due to Thoralf Skolem and Morse. Morse's ow ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inaccessible Cardinal
In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal is strongly inaccessible if it is uncountable, it is not a sum of fewer than cardinals smaller than , and \alpha < \kappa implies . The term "inaccessible cardinal" is ambiguous. Until about 1950, it meant "weakly inaccessible cardinal", but since then it usually means "strongly inaccessible cardinal". An uncountable cardinal is weakly inaccessible if it is a regular weak limit cardinal. It is strongly inaccessible, or just inaccessible, if it is a regular strong limit cardinal (this is equivalent to the definition given above). Some authors do not require weakly and strongl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom Of Replacement
In set theory, the axiom schema of replacement is a schema of axioms in Zermelo–Fraenkel set theory (ZF) that asserts that the image of any set under any definable mapping is also a set. It is necessary for the construction of certain infinite sets in ZF. The axiom schema is motivated by the idea that whether a class is a set depends only on the cardinality of the class, not on the rank of its elements. Thus, if one class is "small enough" to be a set, and there is a surjection from that class to a second class, the axiom states that the second class is also a set. However, because ZFC only speaks of sets, not proper classes, the schema is stated only for definable surjections, which are identified with their defining formulas. Statement Suppose P is a definable binary relation (which may be a proper class) such that for every set x there is a unique set y such that P(x,y) holds. There is a corresponding definable function F_P, where F_P(x)=y if and only if P(x,y). Consid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zermelo Set Theory
Zermelo set theory (sometimes denoted by Z-), as set out in a seminal paper in 1908 by Ernst Zermelo, is the ancestor of modern Zermelo–Fraenkel set theory (ZF) and its extensions, such as von Neumann–Bernays–Gödel set theory (NBG). It bears certain differences from its descendants, which are not always understood, and are frequently misquoted. This article sets out the original axioms, with the original text (translated into English) and original numbering. The axioms of Zermelo set theory The axioms of Zermelo set theory are stated for objects, some of which (but not necessarily all) are sets, and the remaining objects are urelements and not sets. Zermelo's language implicitly includes a membership relation ∈, an equality relation = (if it is not included in the underlying logic), and a unary predicate saying whether an object is a set. Later versions of set theory often assume that all objects are sets so there are no urelements and there is no need for the unary ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Universe (set Theory)
In mathematics, and particularly in set theory, category theory, type theory, and the foundations of mathematics, a universe is a collection that contains all the entities one wishes to consider in a given situation. In set theory, universes are often classes that contain (as elements) all sets for which one hopes to prove a particular theorem. These classes can serve as inner models for various axiomatic systems such as ZFC or Morse–Kelley set theory. Universes are of critical importance to formalizing concepts in category theory inside set-theoretical foundations. For instance, the canonical motivating example of a category is Set, the category of all sets, which cannot be formalized in a set theory without some notion of a universe. In type theory, a universe is a type whose elements are types. In a specific context Perhaps the simplest version is that ''any'' set can be a universe, so long as the object of study is confined to that particular set. If the object of stu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom Of Infinity
In axiomatic set theory and the branches of mathematics and philosophy that use it, the axiom of infinity is one of the axioms of Zermelo–Fraenkel set theory. It guarantees the existence of at least one infinite set, namely a set containing the natural numbers. It was first published by Ernst Zermelo as part of his set theory in 1908.Zermelo: ''Untersuchungen über die Grundlagen der Mengenlehre'', 1907, in: Mathematische Annalen 65 (1908), 261-281; Axiom des Unendlichen p. 266f. Formal statement In the formal language of the Zermelo–Fraenkel axioms, the axiom reads: :\exists \mathbf \, ( \empty \in \mathbf \, \land \, \forall x \in \mathbf \, ( \, ( x \cup \ ) \in \mathbf ) ) . In words, there is a set I (the set which is postulated to be infinite), such that the empty set is in I, and such that whenever any ''x'' is a member of I, the set formed by taking the union of ''x'' with its singleton is also a member of I. Such a set is sometimes called an inductive set. I ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Model (logic)
In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations that are defined on it. Universal algebra studies structures that generalize the algebraic structures such as groups, rings, fields and vector spaces. The term universal algebra is used for structures with no relation symbols. Model theory has a different scope that encompasses more arbitrary theories, including foundational structures such as models of set theory. From the model-theoretic point of view, structures are the objects used to define the semantics of first-order logic. For a given theory in model theory, a structure is called a model if it satisfies the defining axioms of that theory, although it is sometimes disambiguated as a ''semantic model'' when one discusses the notion in the more general setting of mathematical models. Logicians sometimes refer to structures as "interpretations", whereas the term "interpretation" generally ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hereditarily Finite Set
In mathematics and set theory, hereditarily finite sets are defined as finite sets whose elements are all hereditarily finite sets. In other words, the set itself is finite, and all of its elements are finite sets, recursively all the way down to the empty set. Formal definition A recursive definition of well-founded hereditarily finite sets is as follows: : ''Base case'': The empty set is a hereditarily finite set. : ''Recursion rule'': If ''a''1,...,''a''''k'' are hereditarily finite, then so is . The set \ is an example for such a hereditarily finite set and so is the empty set \emptyset=\. On the other hand, the sets \ or \ are examples of finite sets that are not ''hereditarily'' finite. For example, the first cannot be hereditarily finite since it contains at least one infinite set as an element, when = \. Discussion A symbol for the class of hereditarily finite sets is H_, standing for the cardinality of each of its member being smaller than \aleph_0. Whether H_ is a s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called '' cardinal numbers'', and numbers used for ordering are called '' ordinal numbers''. Natural numbers are sometimes used as labels, known as '' nominal numbers'', having none of the properties of numbers in a mathematical sense (e.g. sports jersey numbers). Some definitions, including the standard ISO 80000-2, begin the natural numbers with , corresponding to the non-negative integers , whereas others start with , corresponding to the positive integers Texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, while in other writings, that term is used instead for the integers (including negative integers). The natural numbers form a set. Many other number sets are built by suc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
