Set-theoretic definition of natural numbers

Last updated

In set theory, several ways have been proposed to construct the natural numbers. These include the representation via von Neumann ordinals, commonly employed in axiomatic set theory, and a system based on equinumerosity that was proposed by Gottlob Frege and by Bertrand Russell.

Contents

Definition as von Neumann ordinals

In Zermelo–Fraenkel (ZF) set theory, the natural numbers are defined recursively by letting 0 = {} be the empty set and n + 1 (the successor function) = n ∪ {n} for each n. In this way n = {0, 1, …, n − 1} for each natural number n. This definition has the property that n is a set with n elements. The first few numbers defined this way are: ( Goldrei 1996 )

The set N of natural numbers is defined in this system as the smallest set containing 0 and closed under the successor function S defined by S(n) = n ∪ {n}. The structure ⟨N, 0, S⟩ is a model of the Peano axioms ( Goldrei 1996 ). The existence of the set N is equivalent to the axiom of infinity in ZF set theory.

The set N and its elements, when constructed this way, are an initial part of the von Neumann ordinals. Quine refer to these sets as "counter sets". [1]

Frege and Russell

Gottlob Frege and Bertrand Russell each proposed defining a natural number n as the collection of all sets with n elements. More formally, a natural number is an equivalence class of finite sets under the equivalence relation of equinumerosity. This definition may appear circular, but it is not, because equinumerosity can be defined in alternate ways, for instance by saying that two sets are equinumerous if they can be put into one-to-one correspondence—this is sometimes known as Hume's principle.

This definition works in type theory, and in set theories that grew out of type theory, such as New Foundations and related systems. However, it does not work in the axiomatic set theory ZFC nor in certain related systems, because in such systems the equivalence classes under equinumerosity are proper classes rather than sets.

For enabling natural numbers to form a set, equinumerous classes are replaced by special sets, named cardinal. The simplest way to introduce cardinals is to add a primitive notion, Card(), and an axiom of cardinality to ZF set theory (without axiom of choice). [2]

Axiom of cardinality: The sets A and B are equinumerous if and only if Card(A) = Card(B)

Definition: the sum of cardinals K and L such as K= Card(A) and L = Card(B) where the sets A and B are disjoint, is Card (A ∪ B).

The definition of a finite set is given independently of natural numbers: [3]

Definition: A set is finite if and only if any non empty family of its subsets has a minimal element for the inclusion order.

Definition: a cardinal n is a natural number if and only if there exists a finite set of which the cardinal is n.

0 = Card (∅)

1 = Card({A}) = Card({∅})

Definition: the successor of a cardinal K is the cardinal K + 1

Theorem: the natural numbers satisfy Peano’s axioms

Hatcher

William S. Hatcher (1982) derives Peano's axioms from several foundational systems, including ZFC and category theory, and from the system of Frege's Grundgesetze der Arithmetik using modern notation and natural deduction. The Russell paradox proved this system inconsistent, but George Boolos (1998) and David J. Anderson and Edward Zalta (2004) show how to repair it.

See also

Related Research Articles

<span class="mw-page-title-main">Axiom of choice</span> Axiom of set theory

In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory equivalent to the statement that a Cartesian product of a collection of non-empty sets is non-empty. Informally put, the axiom of choice says that given any collection of sets, each containing at least one element, it is possible to construct a new set by choosing one element from each set, even if the collection is infinite. Formally, it states that for every indexed family of nonempty sets, there exists an indexed set such that for every . The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem.

In mathematics, the axiom of regularity is an axiom of Zermelo–Fraenkel set theory that states that every non-empty set A contains an element that is disjoint from A. In first-order logic, the axiom reads:

Naive set theory is any of several theories of sets used in the discussion of the foundations of mathematics. 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, and suffices for the everyday use of set theory concepts in contemporary mathematics.

Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics.

<span class="mw-page-title-main">Set theory</span> Branch of mathematics that studies sets

Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory — as a branch of mathematics — is mostly concerned with those that are relevant to mathematics as a whole.

In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded.

Foundations of mathematics is the logical and mathematical framework that allows the development of mathematics without generating self-contradictory theories, and, in particular, to have reliable concepts of theorems, proofs, algorithms, etc. This may also include the philosophical study of the relation of this framework with reality.

In mathematics and logic, an axiomatic system is any set of primitive notions and axioms to logically derive theorems. A theory is a consistent, relatively-self-contained body of knowledge which usually contains an axiomatic system and all its derived theorems. An axiomatic system that is completely described is a special kind of formal system. A formal theory is an axiomatic system that describes a set of sentences that is closed under logical implication. A formal proof is a complete rendition of a mathematical proof within a formal system.

In logic and mathematics, second-order logic is an extension of first-order logic, which itself is an extension of propositional logic. Second-order logic is in turn extended by higher-order logic and type theory.

In the philosophy of mathematics, logicism is a programme comprising one or more of the theses that – for some coherent meaning of 'logic' – mathematics is an extension of logic, some or all of mathematics is reducible to logic, or some or all of mathematics may be modelled in logic. Bertrand Russell and Alfred North Whitehead championed this programme, initiated by Gottlob Frege and subsequently developed by Richard Dedekind and Giuseppe Peano.

In mathematics, two sets or classes A and B are equinumerous if there exists a one-to-one correspondence (or bijection) between them, that is, if there exists a function from A to B such that for every element y of B, there is exactly one element x of A with f(x) = y. Equinumerous sets are said to have the same cardinality (number of elements). The study of cardinality is often called equinumerosity (equalness-of-number). The terms equipollence (equalness-of-strength) and equipotence (equalness-of-power) are sometimes used instead.

In set theory, the concept of cardinality is significantly developable without recourse to actually defining cardinal numbers as objects in the theory itself. The concepts are developed by defining equinumerosity in terms of functions and the concepts of one-to-one and onto ; this gives us a quasi-ordering relation

In mathematical logic, New Foundations (NF) is a non-well-founded, finitely axiomatizable set theory conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica.

In mathematics, a set A is Dedekind-infinite if some proper subset B of A is equinumerous to A. Explicitly, this means that there exists a bijective function from A onto some proper subset B of A. A set is Dedekind-finite if it is not Dedekind-infinite. Proposed by Dedekind in 1888, Dedekind-infiniteness was the first definition of "infinite" that did not rely on the definition of the natural numbers.

In mathematics, Robinson arithmetic is a finitely axiomatized fragment of first-order Peano arithmetic (PA), first set out by Raphael M. Robinson in 1950. It is usually denoted Q. Q is almost PA without the axiom schema of mathematical induction. Q is weaker than PA but it has the same language, and both theories are incomplete. Q is important and interesting because it is a finitely axiomatized fragment of PA that is recursively incompletable and essentially undecidable.

In the foundations of mathematics, Morse–Kelley set theory (MK), Kelley–Morse set theory (KM), Morse–Tarski set theory (MT), Quine–Morse set theory (QM) or the system of Quine and Morse is a first-order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory restricts the bound variables in the schematic formula appearing in the axiom schema of Class Comprehension to range over sets alone, Morse–Kelley set theory allows these bound variables to range over proper classes as well as sets, as first suggested by Quine in 1940 for his system ML.

An approach to the foundations of mathematics that is of relatively recent origin, Scott–Potter set theory is a collection of nested axiomatic set theories set out by the philosopher Michael Potter, building on earlier work by the mathematician Dana Scott and the philosopher George Boolos.

General set theory (GST) is George Boolos's (1998) name for a fragment of the axiomatic set theory Z. GST is sufficient for all mathematics not requiring infinite sets, and is the weakest known set theory whose theorems include the Peano axioms.

Class logic is a logic in its broad sense, whose objects are called classes. In a narrower sense, one speaks of a class logic only if classes are described by a property of their elements. This class logic is thus a generalization of set theory, which allows only a limited consideration of classes.

References

Citations

  1. ↑ W. V. O. Quine, Mathematical Logic (1981), p.247. Harvard University Press, 0-674-55451-5.
  2. ↑ Fraenkel 1968.
  3. ↑ Suppes 1972.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.