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
  • 34 bytes (5 words) - 12:47, 13 December 2008
  • 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>&nbsp;&nbsp;''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 re
    805 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
  • 127 bytes (21 words) - 13:07, 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=Stanf
    865 bytes (130 words) - 09:37, 4 July 2011
  • 94 bytes (12 words) - 12:32, 30 November 2008
  • {{r|Set theory}}
    912 bytes (145 words) - 13:30, 28 November 2008

Page text matches

  • Paul R. Halmos, ''Naive Set Theory.'' <br>&nbsp;&nbsp;''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 <mat
    184 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 exists
    182 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 elemen
    199 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.goo
    764 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 re
    805 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=Stanf
    865 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=Stanf
    865 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
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)