Naive set theory

Short description: Informal set theories

This article is about the mathematical topic. For the book of the same name, see Naive Set Theory (book).

Naive set theory is any of several theories of sets used in the discussion of the foundations of mathematics.[3] Unlike axiomatic set theories, which are defined using formal logic, naive set theory is defined informally, in natural language. It describes the aspects of mathematical sets familiar in discrete mathematics (for example Venn diagrams and symbolic reasoning about their Boolean algebra), and suffices for the everyday use of set theory concepts in contemporary mathematics.[4]

Sets are of great importance in mathematics; in modern formal treatments, most mathematical objects (numbers, relations, functions, etc.) are defined in terms of sets. Naive set theory suffices for many purposes, while also serving as a stepping stone towards more formal treatments.

## Contents

* 1 Method
* 1.1 Paradoxes
* 1.2 Cantor's theory
* 1.3 Axiomatic theories
* 1.4 Consistency
* 1.5 Utility
* 2 Sets, membership and equality
* 2.1 Note on consistency
* 2.2 Membership
* 2.3 Equality
* 2.4 Empty set
* 3 Specifying sets
* 4 Subsets
* 5 Universal sets and absolute complements
* 6 Unions, intersections, and relative complements
* 7 Ordered pairs and Cartesian products
* 8 Some important sets
* 9 Paradoxes in early set theory
* 10 See also
* 11 Notes
* 12 References
* 13 External links

## Method

A naive theory in the sense of "naive set theory" is a non-formalized theory, that is, a theory that uses natural language to describe sets and operations on sets. Such theory treats sets as platonic absolute objects. The words and, or, if ... then, not, for some, for every are treated as in ordinary mathematics. As a matter of convenience, use of naive set theory and its formalism prevails even in higher mathematics - including in more formal settings of set theory itself.

The first development of set theory was a naive set theory. It was created at the end of the 19th century by Georg Cantor as part of his study of infinite sets[5] and developed as a formal but inconsistent system [6] by Gottlob Frege in his Grundgesetze der Arithmetik.

Naive set theory may refer to several very distinct notions. It may refer to

* Informal presentation of an axiomatic set theory, e.g. as in Naive Set Theory by Paul Halmos.
* Early or later versions of Georg Cantor's theory and other informal systems.
* Decidedly inconsistent theories (whether axiomatic or not), such as a theory of Gottlob Frege[7] that yielded Russell's paradox, and theories of Giuseppe Peano[8] and Richard Dedekind.

### Paradoxes

The assumption that any property may be used to form a set, without restriction, leads to paradoxes. One common example is Russell's paradox: there is no set consisting of "all sets that do not contain themselves". Thus consistent systems of (either naive or formal) set theory must include some limitations on the principles which can be used to form sets.

### Cantor's theory

Some believe that Georg Cantor's set theory was not actually implicated in the set-theoretic paradoxes (see Frápolli 1991). One difficulty in determining this with certainty is that Cantor did not provide an axiomatization of his system. By 1899, Cantor was aware of some of the paradoxes following from unrestricted interpretation of his theory, for instance Cantor's paradox[9] and the Burali-Forti paradox,[10] and did not believe that they discredited his theory.[11] Cantor's paradox can actually be derived from the above (false) assumption—that any property P(x) may be used to form a set—using for P(x) "x is a cardinal number". Frege explicitly axiomatized a theory in which a formalized version of naive set theory can be interpreted, and it is this formal theory which Bertrand Russell actually addressed when he presented his paradox, not necessarily a theory Cantor—who, as mentioned, was aware of several paradoxes—presumably had in mind.

### Axiomatic theories

Axiomatic set theory was developed in response to these early attempts to understand sets, with the goal of determining precisely what operations were allowed and when.

### Consistency

A naive set theory is not necessarily inconsistent, if it correctly specifies the sets allowed to be considered. This can be done by the means of definitions, which are implicit axioms. It is possible to state all the axioms explicitly, as in the case of Halmos' Naive Set Theory, which is actually an informal presentation of the usual axiomatic Zermelo–Fraenkel set theory. It is "naive" in that the language and notations are those of ordinary informal mathematics, and in that it does not deal with consistency or completeness of the axiom system.

Likewise, an axiomatic set theory is not necessarily consistent: not necessarily free of paradoxes. It follows from Gödel's incompleteness theorems that a sufficiently complicated first-order logic system (which includes most common axiomatic set theories) cannot be proved consistent[12] from within the theory itself - unless it is actually inconsistent. However, the common axiomatic systems are generally believed to be consistent; by their axioms they do exclude some paradoxes, like Russell's paradox. Based on Gödel's theorem, it is just not known - and never can be - if there are no paradoxes at all in these theories or in any sufficiently complicated first-order set theory, again, unless such theories are actually inconsistent. It should be mentioned, however, that results in proof theoretical ordinal analysis are sometimes interpreted as consistency proofs.

The term naive set theory is still today also used in some literature[13] to refer to the set theories studied by Frege and Cantor, rather than to the informal counterparts of modern axiomatic set theory.

### Utility

The choice between an axiomatic approach and other approaches is largely a matter of convenience. In everyday mathematics the best choice may be informal use of axiomatic set theory. References to particular axioms typically then occur only when demanded by tradition, e.g. the axiom of choice is often mentioned when used. Likewise, formal proofs occur only when warranted by exceptional circumstances. This informal usage of axiomatic set theory can have (depending on notation) precisely the appearance of naive set theory as outlined below. It is considerably easier to read and write (in the formulation of most statements, proofs, and lines of discussion) and is less error-prone than a strictly formal approach.

## Sets, membership and equality

In naive set theory, a set is described as a well-defined collection of objects. These objects are called the elements or members of the set. Objects can be anything: numbers, people, other sets, etc. For instance, 4 is a member of the set of all even integers. Clearly, the set of even numbers is infinitely large; there is no requirement that a set be finite.

Passage with the original set definition of Georg Cantor

The definition of sets goes back to Georg Cantor. He wrote in his 1915 article Beiträge zur Begründung der transfiniten Mengenlehre:

> Unter einer 'Menge' verstehen wir jede Zusammenfassung M von bestimmten wohlunterschiedenen Objekten unserer Anschauung oder unseres Denkens (welche die 'Elemente' von M genannt werden) zu einem Ganzen.

— Georg Cantor

> A set is a gathering together into a whole of definite, distinct objects of our perception or of our thought—which are called elements of the set.

— Georg Cantor

First usage of the symbol ϵ in the work Arithmetices principia nova methodo exposita by Giuseppe Peano

### Note on consistency

It does not follow from this definition how sets can be formed, and what operations on sets again will produce a set. The term "well-defined" in "well-defined collection of objects" cannot, by itself, guarantee the consistency and unambiguity of what exactly constitutes and what does not constitute a set. Attempting to achieve this would be the realm of axiomatic set theory or of axiomatic class theory.

The problem, in this context, with informally formulated set theories, not derived from (and implying) any particular axiomatic theory, is that there may be several widely differing formalized versions, that have both different sets and different rules for how new sets may be formed, that all conform to the original informal definition. For example, Cantor's verbatim definition allows for considerable freedom in what constitutes a set. On the other hand, it is unlikely that Cantor was particularly interested in sets containing cats and dogs, but rather only in sets containing purely mathematical objects. An example of such a class of sets could be the von Neumann universe. But even when fixing the class of sets under consideration, it is not always clear which rules for set formation are allowed without introducing paradoxes.

For the purpose of fixing the discussion below, the term "well-defined" should instead be interpreted as an intention, with either implicit or explicit rules (axioms or definitions), to rule out inconsistencies. The purpose is to keep the often deep and difficult issues of consistency away from the, usually simpler, context at hand. An explicit ruling out of all conceivable inconsistencies (paradoxes) cannot be achieved for an axiomatic set theory anyway, due to Gödel's second incompleteness theorem, so this does not at all hamper the utility of naive set theory as compared to axiomatic set theory in the simple contexts considered below. It merely simplifies the discussion. Consistency is henceforth taken for granted unless explicitly mentioned.

### Membership

If x is a member of a set A, then it is also said that x belongs to A, or that x is in A. This is denoted by x ∈ A. The symbol ∈ is a derivation from the lowercase Greek letter epsilon, "ε", introduced by Giuseppe Peano in 1889 and is the first letter of the word ἐστί (means "is"). The symbol ∉ is often used to write x ∉ A, meaning "x is not in A".

### Equality

Two sets A and B are defined to be equal when they have precisely the same elements, that is, if every element of A is an element of B and every element of B is an element of A. (See axiom of extensionality.) Thus a set is completely determined by its elements; the description is immaterial. For example, the set with elements 2, 3, and 5 is equal to the set of all prime numbers less than 6. If the sets A and B are equal, this is denoted symbolically as A = B (as usual).

### Empty set

The empty set, denoted as ∅ and sometimes {}, is a set with no members at all. Because a set is determined completely by its elements, there can be only one empty set. (See axiom of empty set.)[14] Although the empty set has no members, it can be a member of other sets. Thus ∅≠{∅}, because the former has no members and the latter has one member.[15]

## Specifying sets

The simplest way to describe a set is to list its elements between curly braces (known as defining a set extensionally). Thus {1, 2} denotes the set whose only elements are 1 and 2. (See axiom of pairing.) Note the following points:

* The order of elements is immaterial; for example, {1, 2} = {2, 1}.
* Repetition (multiplicity) of elements is irrelevant; for example, {1, 2, 2} = {1, 1, 1, 2} = {1, 2}.

(These are consequences of the definition of equality in the previous section.)

This notation can be informally abused by saying something like {dogs} to indicate the set of all dogs, but this example would usually be read by mathematicians as "the set containing the single element dogs".

An extreme (but correct) example of this notation is {}, which denotes the empty set.

The notation {x : P(x)}, or sometimes {x |P(x)}, is used to denote the set containing all objects for which the condition P holds (known as defining a set intensionally). For example, {x | x ∈ R} denotes the set of real numbers, {x | x has blonde hair} denotes the set of everything with blonde hair.

This notation is called set-builder notation (or "set comprehension", particularly in the context of Functional programming). Some variants of set builder notation are:

* {x ∈ A | P(x)} denotes the set of all x that are already members of A such that the condition P holds for x. For example, if Z is the set of integers, then {x ∈ Z | x is even} is the set of all even integers. (See axiom of specification.)
* {F(x) | x ∈ A} denotes the set of all objects obtained by putting members of the set A into the formula F. For example, {2x | x ∈ Z} is again the set of all even integers. (See axiom of replacement.)
* {F(x) | P(x)} is the most general form of set builder notation. For example, {x′s owner | x is a dog} is the set of all dog owners.

## Subsets

Given two sets A and B, A is a subset of B if every element of A is also an element of B. In particular, each set B is a subset of itself; a subset of B that is not equal to B is called a proper subset.

If A is a subset of B, then one can also say that B is a superset of A, that A is contained in B, or that B contains A. In symbols, A ⊆ B means that A is a subset of B, and B ⊇ A means that B is a superset of A. Some authors use the symbols ⊂ and ⊃ for subsets, and others use these symbols only for proper subsets. For clarity, one can explicitly use the symbols ⊊ and ⊋ to indicate non-equality.

As an illustration, let R be the set of real numbers, let Z be the set of integers, let O be the set of odd integers, and let P be the set of current or former U.S. Presidents. Then O is a subset of Z, Z is a subset of R, and (hence) O is a subset of R, where in all cases subset may even be read as proper subset. Not all sets are comparable in this way. For example, it is not the case either that R is a subset of P nor that P is a subset of R.

It follows immediately from the definition of equality of sets above that, given two sets A and B, A = B if and only if A ⊆ B and B ⊆ A. In fact this is often given as the definition of equality. Usually when trying to prove that two sets are equal, one aims to show these two inclusions. The empty set is a subset of every set (the statement that all elements of the empty set are also members of any set A is vacuously true).

The set of all subsets of a given set A is called the power set of A and is denoted by 2A or P(A); the "P" is sometimes in a script font: ℘(A). If the set A has n elements, then P(A) will have 2n elements.

## Universal sets and absolute complements

In certain contexts, one may consider all sets under consideration as being subsets of some given universal set. For instance, when investigating properties of the real numbers R (and subsets of R), R may be taken as the universal set. A true universal set is not included in standard set theory (see Paradoxes below), but is included in some non-standard set theories.

Given a universal set U and a subset A of U, the complement of A (in U) is defined as

AC := {x ∈ U | x ∉ A}.

In other words, AC ("A-complement"; sometimes simply A', "A-prime" ) is the set of all members of U which are not members of A. Thus with R, Z and O defined as in the section on subsets, if Z is the universal set, then OC is the set of even integers, while if R is the universal set, then OC is the set of all real numbers that are either even integers or not integers at all.

## Unions, intersections, and relative complements

Given two sets A and B, their union is the set consisting of all objects which are elements of A or of B or of both (see axiom of union). It is denoted by A ∪ B.

The intersection of A and B is the set of all objects which are both in A and in B. It is denoted by A ∩ B.

Finally, the relative complement of B relative to A, also known as the set theoretic difference of A and B, is the set of all objects that belong to A but not to B. It is written as A ∖ B or A − B.

Symbolically, these are respectively

A ∪ B := {x | (x ∈ A) ∨ (x ∈ B)};
A ∩ B := {x | (x ∈ A) ∧ (x ∈ B)} = {x ∈ A | x ∈ B} = {x ∈ B | x ∈ A};
A ∖ B := {x | (x ∈ A) ∧ ¬ (x ∈ B)} = {x ∈ A | ¬ (x ∈ B)}.

The set B doesn't have to be a subset of A for A ∖ B to make sense; this is the difference between the relative complement and the absolute complement (AC = U ∖ A) from the previous section.

To illustrate these ideas, let A be the set of left-handed people, and let B be the set of people with blond hair. Then A ∩ B is the set of all left-handed blond-haired people, while A ∪ B is the set of all people who are left-handed or blond-haired or both. A ∖ B, on the other hand, is the set of all people that are left-handed but not blond-haired, while B ∖ A is the set of all people who have blond hair but aren't left-handed.

Now let E be the set of all human beings, and let F be the set of all living things over 1000 years old. What is E ∩ F in this case? No living human being is over 1000 years old, so E ∩ F must be the empty set {}.

For any set A, the power set P(A) is a Boolean algebra under the operations of union and intersection.

## Ordered pairs and Cartesian products

Intuitively, an ordered pair is simply a collection of two objects such that one can be distinguished as the first element and the other as the second element, and having the fundamental property that, two ordered pairs are equal if and only if their first elements are equal and their second elements are equal.

Formally, an ordered pair with first coordinate a, and second coordinate b, usually denoted by (a, b), can be defined as the set {{a},{a,b}}.

It follows that, two ordered pairs (a,b) and (c,d) are equal if and only if a = c and b = d.

Alternatively, an ordered pair can be formally thought of as a set {a,b} with a total order.

(The notation (a, b) is also used to denote an open interval on the real number line, but the context should make it clear which meaning is intended. Otherwise, the notation ]a, b[ may be used to denote the open interval whereas (a, b) is used for the ordered pair).

If A and B are sets, then the Cartesian product (or simply product) is defined to be:

A × B = {(a,b) | a ∈ A and b ∈ B}.

That is, A × B is the set of all ordered pairs whose first coordinate is an element of A and whose second coordinate is an element of B.

This definition may be extended to a set A × B × C of ordered triples, and more generally to sets of ordered n-tuples for any positive integer n. It is even possible to define infinite Cartesian products, but this requires a more recondite definition of the product.

Cartesian products were first developed by René Descartes in the context of analytic geometry. If R denotes the set of all real numbers, then R2 := R × R represents the Euclidean plane and R3 := R × R × R represents three-dimensional Euclidean space.

## Some important sets

There are some ubiquitous sets for which the notation is almost universal. Some of these are listed below. In the list, a, b, and c refer to natural numbers, and r and s are real numbers.

1. Natural numbers are used for counting. A blackboard bold capital N (ℕ) often represents this set.
2. Integers appear as solutions for x in equations like x \+ a = b. A blackboard bold capital Z (ℤ) often represents this set (from the German Zahlen, meaning numbers).
3. Rational numbers appear as solutions to equations like a \+ bx = c. A blackboard bold capital Q (ℚ) often represents this set (for quotient, because R is used for the set of real numbers).
4. Algebraic numbers appear as solutions to polynomial equations (with integer coefficients) and may involve radicals (including i=−1) and certain other irrational numbers. A Q with an overline (ℚ‾) often represents this set. The overline denotes the operation of algebraic closure.
5. Real numbers represent the "real line" and include all numbers that can be approximated by rationals. These numbers may be rational or algebraic but may also be transcendental numbers, which cannot appear as solutions to polynomial equations with rational coefficients. A blackboard bold capital R (ℝ) often represents this set.
6. Complex numbers are sums of a real and an imaginary number: r+si. Here either r or s (or both) can be zero; thus, the set of real numbers and the set of strictly imaginary numbers are subsets of the set of complex numbers, which form an algebraic closure for the set of real numbers, meaning that every polynomial with coefficients in ℝ has at least one root in this set. A blackboard bold capital C (ℂ) often represents this set. Note that since a number r+si can be identified with a point (r,s) in the plane, ℂ is basically "the same" as the Cartesian product ℝ×ℝ ("the same" meaning that any point in one determines a unique point in the other and for the result of calculations, it doesn't matter which one is used for the calculation, as long as multiplication rule is appropriate for ℂ).

## Paradoxes in early set theory

Main article: Philosophy:Paradox

The unrestricted formation principle of sets referred to as the axiom schema of unrestricted comprehension,

If P is a property, then there exists a set Y = {x : P(x)},[16]

is the source of several early appearing paradoxes:

* Y = {x | x is an ordinal} led, in the year 1897, to the Burali-Forti paradox, the first published antinomy.
* Y = {x | x is a cardinal} produced Cantor's paradox in 1897.[9]
* Y = {x | {} = {}} yielded Cantor's second antinomy in the year 1899.[11] Here the property P is true for all x, whatever x may be, so Y would be a universal set, containing everything.
* Y = {x | x ∉ x}, i.e. the set of all sets that do not contain themselves as elements, gave Russell's paradox in 1902.

If the axiom schema of unrestricted comprehension is weakened to the axiom schema of specification or axiom schema of separation,

If P is a property, then for any set X there exists a set Y = {x ∈ X : P(x)},[16]

then all the above paradoxes disappear.[16] There is a corollary. With the axiom schema of separation as an axiom of the theory, it follows, as a theorem of the theory:

The set of all sets does not exist.

Or, more spectacularly (Halmos' phrasing[17]): There is no universe. Proof: Suppose that it exists and call it U. Now apply the axiom schema of separation with X = U and for P(x) use x ∉ x. This leads to Russell's paradox again. Hence U cannot exist in this theory.[16]

Related to the above constructions is formation of the set

* Y = {x | (x ∈ x) → {} ≠ {}},

where the statement following the implication certainly is false. It follows, from the definition of Y, using the usual inference rules (and some afterthought when reading the proof in the linked article below) both that Y ∈ Y → {} ≠ {} and Y ∈ Y holds, hence {} ≠ {}. This is Curry's paradox.

It is (perhaps surprisingly) not the possibility of x ∈ x that is problematic. It is again the axiom schema of unrestricted comprehension allowing (x ∈ x) → {} ≠ {} for P(x). With the axiom schema of specification instead of unrestricted comprehension, the conclusion Y ∈ Y does not hold and hence {} ≠ {} is not a logical consequence.

Nonetheless, the possibility of x ∈ x is often removed explicitly[18] or, e.g. in ZFC, implicitly,[19] by demanding the axiom of regularity to hold.[19] One consequence of it is

There is no set X for which X ∈ X,

or, in other words, no set is an element of itself.[20]

The axiom schema of separation is simply too weak (while unrestricted comprehension is a very strong axiom--too strong for set theory) to develop set theory with its usual operations and constructions outlined above.[16] The axiom of regularity is of a restrictive nature as well. Therefore, one is led to the formulation of other axioms to guarantee the existence of enough sets to form a set theory. Some of these have been described informally above and many others are possible. Not all conceivable axioms can be combined freely into consistent theories. For example, the axiom of choice of ZFC is incompatible with the conceivable "every set of reals is Lebesgue measurable". The former implies the latter is false.

## See also

* Algebra of sets
* Axiomatic set theory
* Internal set theory
* List of set identities and relations
* Set theory
* Set (mathematics)
* Partially ordered set

## Notes

1. ↑ "Earliest Known Uses of Some of the Words of Mathematics (S)". April 14, 2020. http://jeff560.tripod.com/s.html.
2. ↑ Halmos 1960, Naive Set Theory.
3. ↑ Jeff Miller writes that naive set theory (as opposed to axiomatic set theory) was used occasionally in the 1940s and became an established term in the 1950s. It appears in Hermann Weyl's review of P. A. Schilpp, ed (1946). "The Philosophy of Bertrand Russell". American Mathematical Monthly 53 (4): 210, and in a review by Laszlo Kalmar (Laszlo Kalmar (1946). "The Paradox of Kleene and Rosser". Journal of Symbolic Logic 11 (4): 136. ).[1] The term was later popularized in a book by Paul Halmos.[2]
4. ↑ Mac Lane, Saunders (1971), "Categorical algebra and set-theoretic foundations", Axiomatic Set Theory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967), Providence, RI: Amer. Math. Soc., pp. 231–240 . "The working mathematicians usually thought in terms of a naive set theory (probably one more or less equivalent to ZF) ... a practical requirement [of any new foundational system] could be that this system could be used "naively" by mathematicians not sophisticated in foundational research" (p. 236).
5. ↑ Cantor 1874.
6. ↑ "Gottlob Frege (Stanford Encyclopedia of Philosophy)". https://plato.stanford.edu/entries/frege/.
7. ↑ Frege 1893 In Volume 2, Jena 1903. pp. 253-261 Frege discusses the antionomy in the afterword.
8. ↑ Peano 1889 Axiom 52. chap. IV produces antinomies.
9. ↑ 9.0 9.1 Letter from Cantor to David Hilbert on September 26, 1897, Meschkowski & Nilson 1991 p. 388.
10. ↑ Letter from Cantor to Richard Dedekind on August 3, 1899, Meschkowski & Nilson 1991 p. 408.
11. ↑ 11.0 11.1 Letters from Cantor to Richard Dedekind on August 3, 1899 and on August 30, 1899, Zermelo 1932 p. 448 (System aller denkbaren Klassen) and Meschkowski & Nilson 1991 p. 407. (There is no set of all sets.)
12. ↑ More precisely, cannot prove certain sentences (within the system) whose natural interpretation asserts the theory's own consistency.
13. ↑ F. R. Drake, Set Theory: An Introduction to Large Cardinals (1974). ISBN 0 444 10535 2.
14. ↑ Halmos 1974, p. 9.
15. ↑ Halmos 1974, p. 10.
16. ↑ 16.0 16.1 16.2 16.3 16.4 Jech 2002, p. 4.
17. ↑ Halmos 1974, Chapter 2.
18. ↑ Halmos 1974, See discussion around Russell's paradox.
19. ↑ 19.0 19.1 Jech 2002, Section 1.6.
20. ↑ Jech 2002, p. 61.

## References

* Bourbaki, N., Elements of the History of Mathematics, John Meldrum (trans.), Springer-Verlag, Berlin, Germany, 1994.
* Cantor, Georg (1874), "Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen", J. Reine Angew. Math. 1874 (77): 258–262, doi:10.1515/crll.1874.77.258, http://www.digizeitschriften.de/main/dms/img/?PPN=GDZPPN002155583 ; see also pdf version
* Devlin, K.J., The Joy of Sets: Fundamentals of Contemporary Set Theory, 2nd edition, Springer-Verlag, New York, NY, 1993.
* María J. Frápolli|Frápolli, María J., 1991, "Is Cantorian set theory an iterative conception of set?". Modern Logic, v. 1 n. 4, 1991, 302–318.
* Frege, Gottlob (1893), Grundgesetze der Arithmetik, 1, Jena
* Halmos, Paul (1960). Naive Set Theory. Princeton, NJ: D. Van Nostrand Company.
* Halmos, Paul (1974). Naive Set Theory (Reprint ed.). New York: Springer-Verlag. ISBN 0-387-90092-6.
* Halmos, Paul (2011). Naive Set Theory (Paperback ed.). Mansfield Centre, CN: D. Van Nostrand Company. ISBN 978-1-61427-131-4.
* Jech, Thomas (2002). Set theory, third millennium edition (revised and expanded). Springer. ISBN 3-540-44085-2.
* Kelley, J.L., General Topology, Van Nostrand Reinhold, New York, NY, 1955.
* van Heijenoort, J., From Frege to Gödel, A Source Book in Mathematical Logic, 1879-1931, Harvard University Press, Cambridge, MA, 1967. Reprinted with corrections, 1977. ISBN 0-674-32449-8.
* Meschkowski, Herbert; Nilson, Winfried (1991), Georg Cantor: Briefe. Edited by the authors., Berlin: Springer, ISBN 3-540-50621-7
* Peano, Giuseppe (1889), Arithmetices Principies nova Methoda exposita, Turin
* Zermelo, Ernst (1932), Georg Cantor: Gesammelte Abhandlungen mathematischen und philosophischen Inhalts. Mit erläuternden Anmerkungen sowie mit Ergänzungen aus dem Briefwechsel Cantor-Dedekind. Edited by the author., Berlin: Springer

## External links

* Beginnings of set theory page at St. Andrews
* Earliest Known Uses of Some of the Words of Mathematics (S)

* v
* t
* e

Mathematical logic

General|

* Formal language
* Formation rule
* Formal proof
* Formal semantics
* Well-formed formula
* Set
* Element
* Class
* Classical logic
* Axiom
* Rule of inference
* Relation
* Theorem
* Logical consequence
* Type theory
* Symbol
* Syntax
* Theory

Systems|

* Formal system
* Deductive system
* Axiomatic system
* Hilbert style systems
* Natural deduction
* Sequent calculus

Traditional logic|

* Proposition
* Inference
* Argument
* Validity
* Cogency
* Syllogism
* Square of opposition
* Venn diagram

Propositional calculus
and Boolean logic

* Boolean functions
* Propositional calculus
* Propositional formula
* Logical connectives
* Truth tables
* Many-valued logic

Predicate logic|

* First-order
* Quantifiers
* Predicate
* Second-order
* Monadic predicate calculus

Naive set theory|

* Set
* Empty set
* Element
* Enumeration
* Extensionality
* Finite set
* Infinite set
* Subset
* Power set
* Countable set
* Uncountable set
* Recursive set
* Domain
* Codomain
* Image
* Map
* Function
* Relation
* Ordered pair

Set theory|

* Foundations of mathematics
* Zermelo–Fraenkel set theory
* Axiom of choice
* General set theory
* Kripke–Platek set theory
* Von Neumann–Bernays–Gödel set theory
* Morse–Kelley set theory
* Tarski–Grothendieck set theory

Model theory|

* Model
* Interpretation
* Non-standard model
* Finite model theory
* Truth value
* Validity

Proof theory|

* Formal proof
* Deductive system
* Formal system
* Theorem
* Logical consequence
* Rule of inference
* Syntax

Computability
theory|

* Recursion
* Recursive set
* Recursively enumerable set
* Decision problem
* Church–Turing thesis
* Computable function
* Primitive recursive function

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Naive set theory. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Naive_set_theory&oldid=4153738"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template