Glossary Of Set Theory

	Glossary Of Set Theory This is a glossary of terms and definitions related to the topic of set theory. Greek !$@ A B C D E F G H ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
picture info	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]
	Cardinal Cardinal or The Cardinal most commonly refers to * Cardinalidae, a family of North and South American birds ''Cardinalis'', genus of three species in the family Cardinalidae Northern cardinal, ''Cardinalis cardinalis'', the common cardinal of eastern North America Pyrrhuloxia or desert cardinal, ''Cardinalis sinuatus'', found in southwest North America Vermilion cardinal, ''Cardinalis phoeniceus'', found in Colombia and Venezuela Cardinal (Catholic Church), a senior official of the Catholic Church *Member of the College of Cardinals Cardinal Health, a health care services company * Cardinal number ** Large cardinal * Cardinal direction, one of the four primary directions: north, south, east, and west * Arizona Cardinals, an American professional football team * St. Louis Cardinals, an American professional baseball team Cardinal or The Cardinal may also refer to: Animals Birds In addition to the aforementioned cardinalids: * ''Paroaria'', a South American genu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	Square Principle In mathematical set theory, a square principle is a combinatorial principle asserting the existence of a cohering sequence of short closed unbounded (club) sets so that no one (long) club set coheres with them all. As such they may be viewed as a kind of incompactness phenomenon. They were introduced by Ronald Jensen in his analysis of the fine structure of the constructible universe L. Definition Define Sing to be the class of all limit ordinals which are not regular. ''Global square'' states that there is a system (C_\beta)_ satisfying: # C_\beta is a club set of \beta. # ot(C_\beta) < \beta # If $\gamma$ is a limit point of $C_\beta$ then $\gamma \in \mathrm$ and $C_\gamma = C_\beta \cap \gamma$ Variant relative to a cardinal Jensen introduced also a local version of the principle., p. 443. If $\kappa$ is an uncountable cardinal, then $\Box_\kappa$ asserts that the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	Clubsuit In mathematics, and particularly in axiomatic set theory, ♣''S'' (clubsuit) is a family of combinatorial principles that are a weaker version of the corresponding ◊''S''; it was introduced in 1975 by Adam Ostaszewski. Definition For a given cardinal number \kappa and a stationary set S \subseteq \kappa, \clubsuit_ is the statement that there is a sequence \left\langle A_\delta: \delta \in S\right\rangle such that * every ''A''''δ'' is a cofinal subset of ''δ'' * for every unbounded subset A \subseteq \kappa, there is a \delta so that A_ \subseteq A \clubsuit_ is usually written as just \clubsuit. ♣ and ◊ It is clear that ◊ ⇒ ♣, and it was shown in 1975 that ♣ + CH ⇒ ◊; however, Saharon Shelah gave a proof in 1980 that there exists a model of ♣ in which CH does not hold, so ♣ and ◊ are not equivalent (since ◊ ⇒ CH). See also Club set In mathematics, particularly in mathematical logic and set theory, a club set is a subset of a limit ordinal ... [...More Info...] [...Related Items...] OR:* [Wikipedia] [Google] [Baidu]
	Diamond Principle In mathematics, and particularly in axiomatic set theory, the diamond principle is a combinatorial principle introduced by Ronald Jensen in that holds in the constructible universe () and that implies the continuum hypothesis. Jensen extracted the diamond principle from his proof that the axiom of constructibility () implies the existence of a Suslin tree. Definitions The diamond principle says that there exists a , a family of sets for such that for any subset of ω1 the set of with is stationary in . There are several equivalent forms of the diamond principle. One states that there is a countable collection of subsets of for each countable ordinal such that for any subset of there is a stationary subset of such that for all in we have and . Another equivalent form states that there exist sets for such that for any subset of there is at least one infinite with . More generally, for a given cardinal number and a stationary set , the statement (someti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	Diagonal Intersection Diagonal intersection is a term used in mathematics, especially in set theory. If \displaystyle\delta is an ordinal number and \displaystyle\langle X_\alpha \mid \alpha<\delta\rangle is a sequence of subsets of $\displaystyle\delta$ , then the ''diagonal intersection'', denoted by : $\displaystyle\Delta_ X_\alpha,$ is defined to be : $\displaystyle\.$ That is, an ordinal $\displaystyle\beta$ is in the diagonal intersection $\displaystyle\Delta_ X_\alpha$ if and only if it is contained in the first $\displaystyle\beta$ members of the sequence. This is the same as : $\cup X_\alpha ),$ [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	List Of Logic Symbols In logic, a set of symbols is commonly used to express logical representation. The following table lists many common symbols, together with their name, how they should be read out loud, and the related field of mathematics. Additionally, the subsequent columns contains an informal explanation, a short example, the Unicode location, the name for use in HTML documents, and the LaTeX symbol. Basic logic symbols Advanced or rarely used logical symbols The following symbols are either advanced and context-sensitive or very rarely used: See also * Glossary of logic * Józef Maria Bocheński * List of notation used in Principia Mathematica * List of mathematical symbols * Logic alphabet, a suggested set of logical symbols * * Logical connective * Mathematical operators and symbols in Unicode * Non-logical symbol * Polish notation * Truth function * Truth table * Wikipedia:WikiProject Logic/Standards for notation References Further reading * Józef Maria Bocheński ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
picture info	Superset In mathematics, a 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. When quantified, A \subseteq B is represented as \forall x \left(x \in A \Rightarrow x \in B\right). One can prove the statement A \subseteq B by applying a proof technique known as the element argument:Let sets ''A'' and ''B'' be given. To prove that A \subseteq B, # suppose that ''a'' is a particular but arbitrarily chosen element of A # show that ''a'' is an element of ''B''. The validity of this technique can be seen as a consequence of univers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
picture info	Subset In mathematics, a Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), 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. When quantified, A \subseteq B is represented as \forall x \left(x \in A \Rightarrow x \in B\right). One can prove the statement A \subseteq B by applying a proof technique known as the element argument:Let sets ''A'' and ''B'' be given. To prove that A \subseteq B, # suppose that ''a'' is a particular but arbitrarily chosen element of A # show that ''a'' is an element of ''B''. The validity of this technique ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	Element (mathematics) In mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ..., an element (or member) of a set is any one of the distinct objects that belong to that set. For example, given a set called containing the first four positive integers (A = \), one could say that "3 is an element of ", expressed notationally as 3 \in A . Sets Writing A = \ means that the elements of the set are the numbers 1, 2, 3 and 4. Sets of elements of , for example \, are subsets of . Sets can themselves be elements. For example, consider the set B = \. The elements of are ''not'' 1, 2, 3, and 4. Rather, there are only three elements of , namely the numbers 1 and 2, and the set \. The elements of a set can be anything. For example the elements of the set C = \ are the color red, the number 12, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]
	Ω-logic In set theory, Ω-logic is an infinitary logic and deductive system proposed by as part of an attempt to generalize the theory of determinacy of pointclasses to cover the structure H_. Just as the axiom of projective determinacy yields a canonical theory of H_, he sought to find axioms that would give a canonical theory for the larger structure. The theory he developed involves a controversial argument that the continuum hypothesis is false. Analysis Woodin's Ω-conjecture asserts that if there is a proper class of Woodin cardinals (for technical reasons, most results in the theory are most easily stated under this assumption), then Ω-logic satisfies an analogue of the completeness theorem. From this conjecture, it can be shown that, if there is any single axiom which is comprehensive over H_ (in Ω-logic), it must imply that the continuum is not \aleph_1. Woodin also isolated a specific axiom, a variation of Martin's maximum, which states that any Ω-consistent \Pi_2 (over H_ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu]

Variant relative to a cardinal