Search results
Jump to navigation
Jump to search
Page title matches
- #REDIRECT [[Talk:Set theory/Draft]]35 bytes (5 words) - 15:54, 30 May 2010
- ...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
- 135 bytes (15 words) - 06:12, 22 October 2013
- 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
- 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
- 19 bytes (2 words) - 13:25, 23 November 2008
- 26 bytes (2 words) - 14:14, 23 November 2008
- | pagename = Set theory | abc = Set theory2 KB (231 words) - 15:52, 30 May 2010
- 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
- ...ned CZ because I thought the world needed a decent introductory account of set theory :-) [[User:Mark Wainwright|Mark Wainwright]] 04:22, 9 May 2010 (UTC) :K. Kunen. Set Theory: An Introduction to Independence Proofs. North-Holland, 1980.61 KB (10,300 words) - 10:45, 7 March 2024
- 12 bytes (1 word) - 13:26, 28 November 2008
- 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
- 94 bytes (12 words) - 12:32, 30 November 2008
- 127 bytes (21 words) - 13:07, 13 December 2008
- *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
- | pagename = Complement (set theory) | abc = Complement (set theory)2 KB (231 words) - 13:25, 28 November 2008
- {{r|Naive set theory}} {{r|Axiomatic set theory}}477 bytes (65 words) - 07:22, 22 July 2011
- {{r|Set theory}}912 bytes (145 words) - 13:30, 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,903 words) - 04:07, 22 November 2023
Page text matches
- == [[Set theory]] == Congratulations, Mark, on [[Set theory]] being approved! If I'm not mistaken that is your first! Hope to see man1 KB (152 words) - 09:48, 3 July 2011
- 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
- #REDIRECT [[Talk:Set theory/Draft]]35 bytes (5 words) - 15:54, 30 May 2010
- {{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
- ...n 1991, for theses on uniform distribution (a topic in number theory) and set theory (a subfield of mathematical logic), respectively. ...rk in algebra (mainly: universal algebra) and mathematical logic (mainly: set theory).784 bytes (126 words) - 04:20, 22 November 2023
- {{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
- ** In [[set theory]], [[intersection]] distributes over [[union]] and union distributes over i2 KB (234 words) - 04:36, 22 November 2023
- 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
- The term '''fuzzy subset''' is a generalization of the subset concept from [[set theory]]. In ordinary set theory, given a [[subset]] of a [[set]] there is always a "yes" or "no" answer to1 KB (168 words) - 13:34, 26 September 2007
- : (Oct 2009): [[Line (Euclidean geometry)]] (E) / [[Set theory]] (E) / [[Cryptography]] (E) / [[Covariance]] (A) / [[Geometric sequence]]2 KB (195 words) - 03:09, 8 March 2024
- ...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
- ===Set theory===3 KB (362 words) - 15:25, 31 October 2014
- ...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
- and initiated the study of infinite numbers, now a major branch of [[set theory]].495 bytes (72 words) - 18:31, 20 June 2009
- {{r|Set theory}}429 bytes (56 words) - 20:24, 11 January 2010
- | title = Classical descriptive set theory292 bytes (32 words) - 03:39, 1 July 2009
- My math interests include knot theory, set theory, calculus, and differential equations. I am also involved in a few open-sou642 bytes (92 words) - 02:32, 22 November 2023
- {{r|Complement (set theory)}}296 bytes (31 words) - 11:00, 31 May 2009
- {{rpl|Fibre (set theory)}}208 bytes (29 words) - 04:09, 26 September 2013
- ...rel; see [[Non-Borel_set/Advanced]] if you are acquainted with descriptive set theory. If you are not, you may find it instructive to try proving that ''A'' is B2 KB (402 words) - 20:47, 30 June 2009
- ...ins ''X'' itself and is closed under the operation of taking [[complement (set theory)|complement]]s, finite [[union]]s and finite [[intersection]]s in ''X''. Th2 KB (324 words) - 16:34, 27 November 2008
- In [[set theory]], the '''kernel of a function''' is the [[equivalence relation]] on the do1 KB (191 words) - 16:00, 7 February 2009
- {{r|Set theory}}207 bytes (28 words) - 18:34, 24 September 2010
- *In [[mathematics]], the term ''element'' is mainly used in [[set theory]], and in various combinations:300 bytes (41 words) - 04:19, 2 September 2009
- In [[set theory]], the '''symmetric difference''' of two sets is the set of elements that b676 bytes (121 words) - 10:13, 23 December 2008
- {{r|Set theory}}2 KB (247 words) - 06:00, 7 November 2010
- ...hen considered as a partially [[ordered set]] with respect to [[inclusion (set theory)|inclusion]].1 KB (213 words) - 17:17, 7 February 2009
- {{r|Set theory}}3 KB (353 words) - 03:48, 24 September 2013
- * {{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-3 KB (440 words) - 12:26, 30 December 2008
- {{rpl|Complement (set theory)}}5 KB (628 words) - 04:35, 22 November 2023
- {{r|Class (set theory)|In mathematics}}204 bytes (28 words) - 11:34, 31 May 2009
- I have a strong background in Set Theory, Analysis, Algebra, and Combinatorics. I also have spent quite a bit of tim439 bytes (67 words) - 03:44, 22 November 2023
- ...closed if <math>X-A=\{x \in X \mid x \notin A\}</math>, the [[complement (set theory)|complement]] of <math>A</math> in <math>X</math>, is an [[open set]]. The2 KB (338 words) - 15:26, 6 January 2009
- ...ics from the University of California, Los Angeles. My specialties within set theory are Borel equivalence relations and quotient Boolean algebras (quotients of822 bytes (122 words) - 04:24, 22 November 2023
- In [[set theory]], a '''transitive relation''' on a [[set (mathematics)|set]] is a [[relati2 KB (295 words) - 14:28, 6 February 2009
- * In [[set theory]], [[intersection]] and [[union]];929 bytes (125 words) - 13:24, 18 November 2022
- * {{cite book | author=Paul Halmos | authorlink=Paul Halmos | title=Naive set theory | series=The University Series in Undergraduate Mathematics | publisher=[[V408 bytes (50 words) - 12:49, 2 November 2008
- | pagename = Complement (set theory) | abc = Complement (set theory)2 KB (231 words) - 13:25, 28 November 2008
- {{r|Set theory}}880 bytes (141 words) - 14:27, 28 November 2008
- {{r|Set theory}}881 bytes (141 words) - 14:33, 28 November 2008
- ...ician '''Georg Ferdinand Ludwig Philipp Cantor''' (1845-1918) introduced [[set theory]] and the concept of [[transfinite number]]s.511 bytes (72 words) - 13:06, 16 March 2011
- {{r|Set theory}}898 bytes (142 words) - 10:17, 23 December 2008
- | pagename = Set theory | abc = Set theory2 KB (231 words) - 15:52, 30 May 2010
- {{r|Set theory}}969 bytes (152 words) - 13:42, 25 September 2010
- {{r|Set theory}}896 bytes (143 words) - 15:56, 28 November 2008
- {{r|Set theory}}908 bytes (144 words) - 13:34, 12 May 2011
- {{r|Set theory}}912 bytes (145 words) - 13:30, 28 November 2008
- {{r|Set theory}}907 bytes (146 words) - 15:31, 11 May 2011
- {{r|Set theory}}907 bytes (145 words) - 14:06, 16 July 2011
- {{r|Set theory}}910 bytes (145 words) - 14:05, 16 July 2011
- {{r|Set theory}}980 bytes (151 words) - 14:51, 11 May 2010
- {{r|Set theory}}271 bytes (43 words) - 12:55, 1 July 2009
- * In [[set theory]], ''standard model'' of the [[natural number]]s usually refers to the set1 KB (212 words) - 21:14, 9 September 2020
- ...h>\scriptstyle\aleph_1</math> is independent of standard axiom systems for set theory. That fact is not at all elementary to prove. It is readily shown (if you4 KB (694 words) - 21:24, 3 November 2007
- {{r|Set theory}}1 KB (172 words) - 15:25, 15 May 2011
- {{r|Set theory}}529 bytes (67 words) - 17:25, 11 January 2010