Search results
Jump to navigation
Jump to search
- {{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