Search results

Jump to navigation Jump to search
  • 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 theory
    292 bytes (32 words) - 03:39, 1 July 2009
  • {{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 B
    2 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''. Th
    2 KB (324 words) - 16:34, 27 November 2008
  • In [[set theory]], the '''kernel of a function''' is the [[equivalence relation]] on the do
    1 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 b
    676 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
  • {{r|Class (set theory)|In mathematics}}
    204 bytes (28 words) - 11:34, 31 May 2009
  • ...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]]. The
    2 KB (338 words) - 15:26, 6 January 2009
  • In [[set theory]], a '''transitive relation''' on a [[set (mathematics)|set]] is a [[relati
    2 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=[[V
    408 bytes (50 words) - 12:49, 2 November 2008
View ( | ) (20 | 50 | 100 | 250 | 500)