Search results
Jump to navigation
Jump to search
Page title matches
- ...out to be a tricky matter. However, some unproblematic examples from naïve set theory will make the concept clearer. These examples will be used throughout this == History of set theory ==24 KB (4,193 words) - 15:48, 23 September 2013
- 19 bytes (2 words) - 13:25, 23 November 2008
- 135 bytes (15 words) - 06:12, 22 October 2013
- 26 bytes (2 words) - 14:14, 23 November 2008
- Paul R. Halmos, ''Naive Set Theory.'' <br> ''A detailed informal introduction based on ZF set theory.''743 bytes (103 words) - 10:26, 10 July 2011
- In [[set theory]], the '''complement''' of a [[subset]] of a given [[set (mathematics)|set] In some version of set theory it is common to postulate a "universal set" <math>\mathcal{U}</math> and re805 bytes (135 words) - 13:24, 28 November 2008
- 710 bytes (65 words) - 15:53, 30 May 2010
- 20 bytes (2 words) - 12:20, 30 November 2008
- 34 bytes (5 words) - 12:47, 13 December 2008
- {{r|Naive set theory}} {{r|Axiomatic set theory}}477 bytes (65 words) - 07:22, 22 July 2011
- 139 bytes (22 words) - 13:28, 28 November 2008
- ...out to be a tricky matter. However, some unproblematic examples from naïve set theory will make the concept clearer. These examples will be used throughout this == History of set theory ==22 KB (3,815 words) - 15:46, 23 September 2013
- *A summary of basic facts about sets is found at: {{cite web |title=Basic set theory |url=http://www.illc.uva.nl/~seop/entries/set-theory/primer.html |work=Stan ...ng overview of set theory and its evolution is found at: {{cite web||title=Set theory |url=http://www.illc.uva.nl/~seop/entries/set-theory/index.html |work=Stanf865 bytes (130 words) - 09:37, 4 July 2011
- 94 bytes (12 words) - 12:32, 30 November 2008
- 127 bytes (21 words) - 13:07, 13 December 2008
- {{r|Set theory}}912 bytes (145 words) - 13:30, 28 November 2008
Page text matches
- Paul R. Halmos, ''Naive Set Theory.'' <br> ''A detailed informal introduction based on ZF set theory.''743 bytes (103 words) - 10:26, 10 July 2011
- In [[set theory]], the '''power set''' of a set ''X'' is the set of all [[subset]]s of ''X' The power set is [[order (relation)|ordered]] by [[inclusion (set theory)|inclusion]], making it a [[lattice (order)|lattice]].317 bytes (49 words) - 14:28, 14 March 2021
- In set theory, this is a set without elements, usually denoted <math>\{~\}</math> or <mat184 bytes (29 words) - 01:06, 19 February 2009
- A [[set theory|set]] with an [[order relation]]83 bytes (11 words) - 10:23, 15 July 2011
- {{r|Set theory}}370 bytes (47 words) - 17:50, 26 June 2009
- Set theory assertion that if S is a set of disjoint, non-empty sets, then there exists182 bytes (30 words) - 08:45, 27 November 2011
- {{r|set theory}} {{r|history of set theory}}206 bytes (26 words) - 16:28, 11 June 2009
- {{r|Naive set theory}} {{r|Axiomatic set theory}}477 bytes (65 words) - 07:22, 22 July 2011
- In [[set theory]], a '''singleton''' is a [[set (mathematics)|set]] with exactly one elemen199 bytes (28 words) - 12:58, 7 February 2009
- ...aCUXZip3bN0C&pg=PA337 |pages=pp. 337 ''ff'' |chapter=The axiomatization of set theory |isbn=0816634602 |year=2003 |publisher=University of Minnesota Press}} *{{cite book |title=Introduction to set theory |author=Karel Hrbacek, Thomas J. Jech |edition=3rd ed |url=http://books.goo764 bytes (113 words) - 09:14, 16 May 2011
- In [[set theory]], the '''complement''' of a [[subset]] of a given [[set (mathematics)|set] In some version of set theory it is common to postulate a "universal set" <math>\mathcal{U}</math> and re805 bytes (135 words) - 13:24, 28 November 2008
- {{r|Class (set theory)|Class}}648 bytes (83 words) - 10:12, 11 May 2009
- {{r|Set theory}} {{r|Naive set theory}}507 bytes (65 words) - 07:17, 22 July 2011
- A chapter of fuzzy set theory.67 bytes (9 words) - 08:05, 4 September 2009
- *A summary of basic facts about sets is found at: {{cite web |title=Basic set theory |url=http://www.illc.uva.nl/~seop/entries/set-theory/primer.html |work=Stan ...ng overview of set theory and its evolution is found at: {{cite web||title=Set theory |url=http://www.illc.uva.nl/~seop/entries/set-theory/index.html |work=Stanf865 bytes (130 words) - 17:17, 2 July 2011
- *A summary of basic facts about sets is found at: {{cite web |title=Basic set theory |url=http://www.illc.uva.nl/~seop/entries/set-theory/primer.html |work=Stan ...ng overview of set theory and its evolution is found at: {{cite web||title=Set theory |url=http://www.illc.uva.nl/~seop/entries/set-theory/index.html |work=Stanf865 bytes (130 words) - 09:37, 4 July 2011
- # If <math>\scriptstyle A\,\in\, F </math> then the [[complement (set theory)|complement]] <math>\scriptstyle A^c \in F</math> [[Set theory]]2 KB (314 words) - 16:35, 27 November 2008
- {{r|Set theory}}245 bytes (29 words) - 09:38, 18 June 2009
- In [[mathematics]], '''partition''' refers to two related concepts, in [[set theory]] and [[number theory]]. ==Partition (set theory)==2 KB (336 words) - 07:17, 16 January 2009
- '''Fuzzy control''' is the main success of fuzzy set theory and it is devoted to useful applications.472 bytes (59 words) - 23:34, 14 February 2010
- {{r|Set theory}}307 bytes (44 words) - 16:27, 26 July 2008
- A classic theorem of set theory asserting that sets can be ordered by size.111 bytes (17 words) - 17:30, 24 September 2010
- ...h J. Devlin | authorlink=Keith Devlin | title=Fundamentals of Contemporary Set Theory | series=Universitext | publisher=[[Springer-Verlag]] | year=1979 | isbn=0- * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V1 KB (146 words) - 17:50, 26 June 2009
- In [[set theory]], a '''subset''' of a [[set (mathematics)|set]] ''X'' is a set ''A'' whose596 bytes (101 words) - 12:42, 30 December 2008
- ...veral possible formulations of [[Set_theory#Axiomatic_set_theory|axiomatic set theory]].132 bytes (17 words) - 15:22, 11 May 2011
- In [[set theory]], the '''characteristic function''' or '''indicator function''' of a [[sub2 KB (242 words) - 02:01, 2 February 2009
- However, the term "aleph-0" is mainly used in the context of [[set theory]]; which finally turned out to be independent of the axioms of set theory:1 KB (214 words) - 13:35, 6 July 2009
- ...ages}}</noinclude>(1845-1918) Danish-German mathematician who introduced [[set theory]] and the concept of [[transcendental number]]s150 bytes (17 words) - 13:07, 16 March 2011
- ...open set]]s are those which have [[countable set|countable]] [[complement (set theory)|complement]], together with the empty set. Equivalently, the [[closed set1,004 bytes (134 words) - 22:48, 17 February 2009
- ...the [[open set]]s are those which have [[finite set|finite]] [[complement (set theory)|complement]], together with the empty set. Equivalently, the [[closed set1,007 bytes (137 words) - 22:52, 17 February 2009
- In [[set theory]], a '''pointed set''' is a [[set (mathematics)|set]] together with a disti1 KB (168 words) - 12:06, 22 November 2008
- ...ties that have the same structure as the [[Schröder-Bernstein theorem]] of set theory.166 bytes (23 words) - 18:06, 25 September 2010
- {{r|Set theory}} {{r|Complement (set theory)}}914 bytes (146 words) - 13:36, 28 November 2008
- {{r|descriptive set theory}}217 bytes (31 words) - 10:31, 21 June 2009
- * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V ...h J. Devlin | authorlink=Keith Devlin | title=Fundamentals of Contemporary Set Theory | series=Universitext | publisher=[[Springer-Verlag]] | year=1979 | isbn=0-611 bytes (74 words) - 12:28, 2 November 2008
- ...h J. Devlin | authorlink=Keith Devlin | title=Fundamentals of Contemporary Set Theory | series=Universitext | publisher=[[Springer-Verlag]] | year=1979 | isbn=0- * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V611 bytes (74 words) - 12:55, 30 November 2008
- ...h J. Devlin | authorlink=Keith Devlin | title=Fundamentals of Contemporary Set Theory | series=Universitext | publisher=[[Springer-Verlag]] | year=1979 | isbn=0- * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V1 KB (135 words) - 16:24, 4 January 2009
- ...h J. Devlin | authorlink=Keith Devlin | title=Fundamentals of Contemporary Set Theory | series=Universitext | publisher=[[Springer-Verlag]] | year=1979 | isbn=0- * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V649 bytes (78 words) - 17:27, 3 November 2008
- ...h J. Devlin | authorlink=Keith Devlin | title=Fundamentals of Contemporary Set Theory | series=Universitext | publisher=[[Springer-Verlag]] | year=1979 | isbn=0- * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V649 bytes (78 words) - 17:30, 3 November 2008
- In [[set theory]], the '''intersection''' of two sets is the set of elements that they have * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V2 KB (284 words) - 14:24, 28 November 2008
- In [[set theory]], a '''filter''' is a family of [[subset]]s of a given set which has prope ...bseteq X</math> either <math>A \in \mathcal{F}</math> or the [[complement (set theory)|complement]] <math>X \setminus A \in \mathcal{F}</math>.2 KB (297 words) - 17:47, 1 December 2008
- requires advanced results from [[descriptive set theory]].2 KB (252 words) - 11:44, 2 December 2010
- In [[set theory]], '''union''' (denoted as ∪) is a set operation between two sets that fo * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V2 KB (264 words) - 17:13, 4 November 2008
- ...h J. Devlin | authorlink=Keith Devlin | title=Fundamentals of Contemporary Set Theory | series=Universitext | publisher=[[Springer-Verlag]] | year=1979 | isbn=0- * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V774 bytes (96 words) - 02:14, 11 November 2008
- A characteristic property of finite sets (which, in [[set theory]] is used to ''define'' finite sets) is the following:1 KB (222 words) - 16:36, 4 January 2013
- {{r|Inclusion (set theory)}}108 bytes (14 words) - 11:04, 31 May 2009
- {{r|Set theory}}267 bytes (32 words) - 19:16, 17 June 2009
- ...s and [[Kurt Gödel]] showed that it was independent of the other axioms of set theory.2 KB (266 words) - 13:28, 5 January 2013
- ...e possible to take the concept of ordered pair as an elementary concept in set theory, but it is more usual to define them in terms of sets. Kuratowksi proposed ...h J. Devlin | authorlink=Keith Devlin | title=Fundamentals of Contemporary Set Theory | series=Universitext | publisher=[[Springer-Verlag]] | year=1979 | isbn=0-1 KB (213 words) - 07:01, 21 January 2009
- ...veral possible formulations of [[Set_theory#Axiomatic_set_theory|axiomatic set theory]]. {{cite book |title=Set theory |author=Thomas J Jech |url= http://books.google.com/books?id=pLxq0myANiEC&p3 KB (512 words) - 17:28, 2 July 2011