|
Transitive Set
In set theory, a branch of mathematics, a set A is called transitive if either of the following equivalent conditions hold: * whenever x \in A, and y \in x, then y \in A. * whenever x \in A, and x is not an urelement, then x is a subset of A. Similarly, a class M is transitive if every element of M is a subset of M. Examples Using the definition of ordinal numbers suggested by John von Neumann, ordinal numbers are defined as hereditarily transitive sets: an ordinal number is a transitive set whose members are also transitive (and thus ordinals). The class of all ordinals is a transitive class. Any of the stages V_\alpha and L_\alpha leading to the construction of the von Neumann universe V and Gödel's constructible universe L are transitive sets. The universes V and L themselves are transitive classes. This is a complete list of all finite transitive sets with up to 20 brackets: * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \ ... [...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] |
Superset
In mathematics, set ''A'' is a subset of a set ''B'' if all elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are unequal, then ''A'' is a proper subset of ''B''. The relationship of one set being a subset of another is called inclusion (or sometimes containment). ''A'' is a subset of ''B'' may also be expressed as ''B'' includes (or contains) ''A'' or ''A'' is included (or contained) in ''B''. A ''k''-subset is a subset with ''k'' elements. The subset relation defines a partial order on sets. In fact, the subsets of a given set form a Boolean algebra under the subset relation, in which the join and meet are given by intersection and union, and the subset relation itself is the Boolean inclusion relation. Definition If ''A'' and ''B'' are sets and every element of ''A'' is also an element of ''B'', then: :*''A'' is a subset of ''B'', denoted by A \subseteq B, or equivalently, :* ''B'' i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Springer-Verlag
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business international ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graduate Texts In Mathematics
Graduate Texts in Mathematics (GTM) (ISSN 0072-5285) is a series of graduate-level textbooks in mathematics published by Springer-Verlag. The books in this series, like the other Springer-Verlag mathematics series, are yellow books of a standard size (with variable numbers of pages). The GTM series is easily identified by a white band at the top of the book. The books in this series tend to be written at a more advanced level than the similar Undergraduate Texts in Mathematics series, although there is a fair amount of overlap between the two series in terms of material covered and difficulty level. List of books #''Introduction to Axiomatic Set Theory'', Gaisi Takeuti, Wilson M. Zaring (1982, 2nd ed., ) #''Measure and Category – A Survey of the Analogies between Topological and Measure Spaces'', John C. Oxtoby (1980, 2nd ed., ) #''Topological Vector Spaces'', H. H. Schaefer, M. P. Wolff (1999, 2nd ed., ) #''A Course in Homological Algebra'', Peter Hilton, Urs Stamm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cambridge University Press
Cambridge University Press is the university press of the University of Cambridge. Granted letters patent by King Henry VIII in 1534, it is the oldest university press in the world. It is also the King's Printer. Cambridge University Press is a department of the University of Cambridge and is both an academic and educational publisher. It became part of Cambridge University Press & Assessment, following a merger with Cambridge Assessment in 2021. With a global sales presence, publishing hubs, and offices in more than 40 countries, it publishes over 50,000 titles by authors from over 100 countries. Its publishing includes more than 380 academic journals, monographs, reference works, school and university textbooks, and English language teaching and learning publications. It also publishes Bibles, runs a bookshop in Cambridge, sells through Amazon, and has a conference venues business in Cambridge at the Pitt Building and the Sir Geoffrey Cass Sports and Social Centre. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Supertransitive Class
In set theory, a supertransitive class is a transitive class which includes as a subset the power set of each of its elements. Formally, let ''A'' be a transitive class. Then ''A'' is supertransitive if and only if :(\forall x)(x\in A \to \mathcal(x) \subseteq A). Here ''P''(''x'') denotes the power set of ''x''.''P''(''x'') must be a set by axiom of power set, since each element ''x'' of a class ''A'' must be a set (Theorem 4.6 in Takeuti's text above). See also * Transitive set * Rank (set theory) 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 ( ... References {{reflist Set theory ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transitive Relation
In mathematics, a relation on a set is transitive if, for all elements , , in , whenever relates to and to , then also relates to . Each partial order as well as each equivalence relation needs to be transitive. Definition A homogeneous relation on the set is a ''transitive relation'' if, :for all , if and , then . Or in terms of first-order logic: :\forall a,b,c \in X: (aRb \wedge bRc) \Rightarrow aRc, where is the infix notation for . Examples As a non-mathematical example, the relation "is an ancestor of" is transitive. For example, if Amy is an ancestor of Becky, and Becky is an ancestor of Carrie, then Amy, too, is an ancestor of Carrie. On the other hand, "is the birth parent of" is not a transitive relation, because if Alice is the birth parent of Brenda, and Brenda is the birth parent of Claire, then this does not imply that Alice is the birth parent of Claire. What is more, it is antitransitive: Alice can ''never'' be the birth parent of Claire. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
End Extension
In model theory and set theory, which are disciplines within mathematics, a model \mathfrak=\langle B, F\rangle of some axiom system of set theory T in the language of set theory is an end extension of \mathfrak=\langle A, E\rangle , in symbols \mathfrak\subseteq_\text\mathfrak, if # \mathfrak is a substructure of \mathfrak, (i.e., A \subseteq B and E = F, _A), and # b\in A whenever a\in A and bFa hold, i.e., no new elements are added by \mathfrak to the elements of A. The second condition can be equivalently written as \=\ for all a\in A. For example, \langle B, \in\rangle is an end extension of \langle A, \in\rangle if A and B are transitive sets, and A\subseteq B. A related concept is that of a top extension (also known as rank extension), where a model \mathfrak=\langle B, F\rangle is a top extension of a model \mathfrak=\langle A, E\rangle if \mathfrak\subseteq_\text\mathfrak and for all a \in A and b \in B\setminus A, we have rank(b) > rank(a), where rank(\c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-standard Analysis
The history of calculus is fraught with philosophical debates about the meaning and logical validity of fluxions or infinitesimal numbers. The standard way to resolve these debates is to define the operations of calculus using epsilon–delta procedures rather than infinitesimals. Nonstandard analysis instead reformulates the calculus using a logically rigorous notion of infinitesimal numbers. Nonstandard analysis originated in the early 1960s by the mathematician Abraham Robinson. He wrote: ... the idea of infinitely small or ''infinitesimal'' quantities seems to appeal naturally to our intuition. At any rate, the use of infinitesimals was widespread during the formative stages of the Differential and Integral Calculus. As for the objection ... that the distance between two distinct real numbers cannot be infinitely small, Gottfried Wilhelm Leibniz argued that the theory of infinitesimals implies the introduction of ideal numbers which might be infinitely small or infinitely ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theory (mathematical Logic)
In mathematical logic, a theory (also called a formal theory) is a set of sentences in a formal language. In most scenarios, a deductive system is first understood from context, after which an element \phi\in T of a deductively closed theory T is then called a theorem of the theory. In many deductive systems there is usually a subset \Sigma \subseteq T that is called "the set of axioms" of the theory T, in which case the deductive system is also called an "axiomatic system". By definition, every axiom is automatically a theorem. A first-order theory is a set of first-order sentences (theorems) recursively obtained by the inference rules of the system applied to the set of axioms. General theories (as expressed in formal language) When defining theories for foundational purposes, additional care must be taken, as normal set-theoretic language may not be appropriate. The construction of a theory begins by specifying a definite non-empty ''conceptual class'' \mathcal, the eleme ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Absoluteness (mathematical Logic)
In mathematical logic, a formula is said to be absolute to some class of structures (also called models), if it has the same truth value in each of the members of that class. One can also speak of absoluteness of a formula ''between'' two structures, if it is absolute to some class which contains both of them.. Theorems about absoluteness typically establish relationships between the absoluteness of formulas and their syntactic form. There are two weaker forms of partial absoluteness. If the truth of a formula in each substructure ''N'' of a structure ''M'' follows from its truth in ''M'', the formula is downward absolute. If the truth of a formula in a structure ''N'' implies its truth in each structure ''M'' extending ''N'', the formula is upward absolute. Issues of absoluteness are particularly important in set theory and model theory, fields where multiple structures are considered simultaneously. In model theory, several basic results and definitions are motivated by a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bounded Quantifier
In the study of formal theories in mathematical logic, bounded quantifiers (a.k.a. restricted quantifiers) are often included in a formal language in addition to the standard quantifiers "∀" and "∃". Bounded quantifiers differ from "∀" and "∃" in that bounded quantifiers restrict the range of the quantified variable. The study of bounded quantifiers is motivated by the fact that determining whether a sentence with only bounded quantifiers is true is often not as difficult as determining whether an arbitrary sentence is true. Examples Examples of bounded quantifiers in the context of real analysis include: * \forall x > 0 - for all ''x'' where ''x'' is larger than 0 * \exists y 0 \quad \exists y < 0 \quad (x = y^2) - every positive number is the square of a negative number Bounded quantifiers in arithmetic Suppose that ''L'' is the language of Peano ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
