Search results

Jump to navigation Jump to search
  • 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=[[V
    2 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=[[V
    774 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&p
    3 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 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
View ( | ) (20 | 50 | 100 | 250 | 500)