|
Prewellordering Example X Div 4 Leq Y Div 5
In set theory, a prewellordering on a set X is a preorder \leq on X (a transitive and reflexive relation on X) that is strongly connected (meaning that any two points are comparable) and well-founded in the sense that the induced relation x < y defined by is a . Prewellordering on a set A prewellordering on a is a homogeneous binary relation on that satisfies the following conditions: |
Set Theory
Set theory is the branch of mathematical logic that studies Set (mathematics), 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 of set theory, 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 the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Order-type
In mathematics, especially in set theory, two ordered sets and are said to have the same order type if they are order isomorphic, that is, if there exists a bijection (each element pairs with exactly one in the other set) f\colon X \to Y such that both and its inverse are monotonic (preserving orders of elements). In the special case when is totally ordered, monotonicity of already implies monotonicity of its inverse. One and the same set may be equipped with different orders. Since order-equivalence is an equivalence relation, it partitions the class of all ordered sets into equivalence classes. Notation If a set X has order type denoted \sigma, the order type of the reversed order, the dual of X, is denoted \sigma^. The order type of a well-ordered set is sometimes expressed as . Examples The order type of the integers and rationals is usually denoted \pi and \eta, respectively. The set of integers and the set of even integers have the same order type, because t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Descriptive Set Theory
In mathematical logic, descriptive set theory (DST) is the study of certain classes of "well-behaved" set (mathematics), subsets of the real line and other Polish spaces. As well as being one of the primary areas of research in set theory, it has applications to other areas of mathematics such as functional analysis, ergodic theory, the study of operator algebras and Group action (mathematics), group actions, and mathematical logic. Polish spaces Descriptive set theory begins with the study of Polish spaces and their Borel sets. A Polish space is a second-countable topological space that is metrizable with a complete metric. Heuristically, it is a complete separable metric space whose metric has been "forgotten". Examples include the real line \mathbb, the Baire space (set theory), Baire space \mathcal, the Cantor space \mathcal, and the Hilbert cube I^. Universality properties The class of Polish spaces has several universality properties, which show that there is no loss ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Borel Set
In mathematics, a Borel set is any subset of a topological space that can be formed from its open sets (or, equivalently, from closed sets) through the operations of countable union, countable intersection, and relative complement. Borel sets are named after Émile Borel. For a topological space ''X'', the collection of all Borel sets on ''X'' forms a σ-algebra, known as the Borel algebra or Borel σ-algebra. The Borel algebra on ''X'' is the smallest σ-algebra containing all open sets (or, equivalently, all closed sets). Borel sets are important in measure theory, since any measure defined on the open sets of a space, or on the closed sets of a space, must also be defined on all Borel sets of that space. Any measure defined on the Borel sets is called a Borel measure. Borel sets and the associated Borel hierarchy also play a fundamental role in descriptive set theory. In some contexts, Borel sets are defined to be generated by the compact sets of the topol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Analytic Set
In the mathematical field of descriptive set theory, a subset of a Polish space X is an analytic set if it is a continuous image of a Polish space. These sets were first defined by and his student . Definition There are several equivalent definitions of analytic set. The following conditions on a subspace ''A'' of a Polish space ''X'' are equivalent: *''A'' is analytic. *''A'' is empty or a continuous image of the Baire space ωω. *''A'' is a Suslin space, in other words ''A'' is the image of a Polish space under a continuous mapping. *''A'' is the continuous image of a Borel set in a Polish space. *''A'' is a Suslin set, the image of the Suslin operation. *There is a Polish space Y and a Borel set B\subseteq X\times Y such that A is the projection of B onto X; that is, : A=\. *''A'' is the projection of a closed set in the cartesian product of ''X'' with the Baire space. *''A'' is the projection of a Gδ set in the cartesian product of ''X'' with the Cantor space 2� ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complement (set Theory)
In set theory, the complement of a Set (mathematics), set , often denoted by A^c (or ), is the set of Element (mathematics), elements not in . When all elements in the Universe (set theory), universe, i.e. all elements under consideration, are considered to be Element (mathematics), members of a given set , the absolute complement of is the set of elements in that are not in . The relative complement of with respect to a set , also termed the set difference of and , written B \setminus A, is the set of elements in that are not in . Absolute complement Definition If is a set, then the absolute complement of (or simply the complement of ) is the set of elements not in (within a larger set that is implicitly defined). In other words, let be a set that contains all the elements under study; if there is no need to mention , either because it has been previously specified, or it is obvious and unique, then the absolute complement of is the relative complement of in : ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dual Pointclass
Dual or Duals may refer to: Paired/two things * Dual (mathematics), a notion of paired concepts that mirror one another ** Dual (category theory), a formalization of mathematical duality *** see more cases in :Duality theories * Dual number, a number system used in automatic differentiation * Dual (grammatical number), a grammatical category used in some languages * Dual county, a Gaelic games county which competes in both Gaelic football and hurling * Dual diagnosis, a psychiatric diagnosis of co-occurrence of substance abuse and a mental problem * Dual fertilization, simultaneous application of a P-type and N-type fertilizer * Dual impedance, electrical circuits that are the dual of each other * Dual SIM cellphone supporting use of two SIMs * Aerochute International Dual a two-seat Australian powered parachute design Acronyms and other uses * Dual (brand), a manufacturer of Hifi equipment * DUAL (cognitive architecture), an artificial intelligence design model * DUAL algorith ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adequate Pointclass
In the mathematical field of descriptive set theory, a pointclass can be called adequate if it contains all recursive Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself. Recursion is used in a variety of disciplines ranging from linguistics to logic. The most common application of recursion is in m ... pointsets and is closed under recursive substitution, bounded universal and existential quantification and preimages by recursive functions.. This ensures that an adequate pointclass is robust enough to include computable sets and remain stable under fundamental operations, making it a key tool for studying the complexity and definability of sets in effective descriptive set theory. References Descriptive set theory {{settheory-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Large Cardinal
In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least α such that α=ωα). The proposition that such cardinals exist cannot be proved in the most common axiomatization of set theory, namely ZFC, and such propositions can be viewed as ways of measuring how "much", beyond ZFC, one needs to assume to be able to prove certain desired results. In other words, they can be seen, in Dana Scott's phrase, as quantifying the fact "that if you want more you have to assume more". There is a rough convention that results provable from ZFC alone may be stated without hypotheses, but that if the proof requires other assumptions (such as the existence of large cardinals), these should be stated. Whether this is simply a linguistic convention, or something more, is a controversial point among distinct ph ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zermelo–Fraenkel Set Theory
In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded. Informally, Zermelo–Fraenkel set theory is intended to formalize a single primitive notion, that of a hereditary well-founded set, so that all entities in the universe of discourse are such sets. Thus the axioms of Zermelo–Fraenkel set theory refer only to pure sets and prevent its models fr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Scale Property
In the mathematical discipline of descriptive set theory, a scale is a certain kind of object defined on a set of points in some Polish space (for example, a scale might be defined on a set of real numbers). Scales were originally isolated as a concept in the theory of uniformization, but have found wide applicability in descriptive set theory, with applications such as establishing bounds on the possible lengths of wellorderings of a given complexity, and showing (under certain assumptions) that there are largest countable sets of certain complexities. Formal definition Given a pointset ''A'' contained in some product space :A\subseteq X=X_0\times X_1\times\ldots X_ where each ''Xk'' is either the Baire space or a countably infinite discrete set, we say that a ''norm'' on ''A'' is a map from ''A'' into the ordinal numbers. Each norm has an associated prewellordering, where one element of ''A'' precedes another element if the norm of the first is less than the norm of the second. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Product
In mathematics, specifically set theory, the Cartesian product of two sets and , denoted , is the set of all ordered pairs where is an element of and is an element of . In terms of set-builder notation, that is A\times B = \. A table can be created by taking the Cartesian product of a set of rows and a set of columns. If the Cartesian product is taken, the cells of the table contain ordered pairs of the form . One can similarly define the Cartesian product of sets, also known as an -fold Cartesian product, which can be represented by an -dimensional array, where each element is an -tuple. An ordered pair is a 2-tuple or couple. More generally still, one can define the Cartesian product of an indexed family of sets. The Cartesian product is named after René Descartes, whose formulation of analytic geometry gave rise to the concept, which is further generalized in terms of direct product. Set-theoretic definition A rigorous definition of the Cartesian product re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
