S is an
axiomatic set theory
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 concern ...
set out by
George Boolos
George Stephen Boolos (; 4 September 1940 – 27 May 1996) was an American philosopher and a mathematical logician who taught at the Massachusetts Institute of Technology.
Life
Boolos is of Greek-Jewish descent. He graduated with an A.B. ...
in his 1989 article, "Iteration Again". S, a
first-order theory, is two-sorted because its
ontology
In metaphysics, ontology is the philosophical study of being, as well as related concepts such as existence, becoming, and reality.
Ontology addresses questions like how entities are grouped into categories and which of these entities ...
includes “stages” as well as
sets. Boolos designed S to embody his understanding of the “iterative conception of set“ and the associated
iterative hierarchy. S has the important property that all axioms of
Zermelo set theory
Zermelo set theory (sometimes denoted by Z-), as set out in a seminal paper in 1908 by Ernst Zermelo, is the ancestor of modern Zermelo–Fraenkel set theory (ZF) and its extensions, such as von Neumann–Bernays–Gödel set theory (NBG). It ...
''Z'', except the
axiom of extensionality
In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of extensionality, or axiom of extension, is one of the axioms of Zermelo–Fraenkel set theory. It says that sets having the same elemen ...
and the
axiom of choice
In mathematics, the axiom of choice, or AC, 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 ...
, are theorems of S or a slight modification thereof.
Ontology
Any grouping together of
mathematical
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
,
abstract
Abstract may refer to:
* ''Abstract'' (album), 1962 album by Joe Harriott
* Abstract of title a summary of the documents affecting title to parcel of land
* Abstract (law), a summary of a legal document
* Abstract (summary), in academic publishi ...
, or concrete objects, however formed, is a ''collection'', a synonym for what other
set theories refer to as a
class. The things that make up a collection are called
elements or members. A common instance of a collection is the
domain of discourse
In the formal sciences, the domain of discourse, also called the universe of discourse, universal set, or simply universe, is the set of entities over which certain variables of interest in some formal treatment may range.
Overview
The dom ...
of a
first-order theory
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifie ...
.
All sets are collections, but there are collections that are not sets. A synonym for collections that are not sets is
proper class
Proper may refer to:
Mathematics
* Proper map, in topology, a property of continuous function between topological spaces, if inverse images of compact subsets are compact
* Proper morphism, in algebraic geometry, an analogue of a proper map f ...
. An essential task of
axiomatic set theory
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 concern ...
is to distinguish sets from proper classes, if only because mathematics is grounded in sets, with proper classes relegated to a purely descriptive role.
The
Von Neumann universe
In set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted by ''V'', is the class of hereditary well-founded sets. This collection, which is formalized by Zermelo–Fraenkel set theory ( ...
implements the “iterative conception of set” by stratifying the universe of sets into a series of "stages", with the sets at a given stage being possible members of the sets formed at all higher stages. The notion of stage goes as follows. Each stage is assigned an
ordinal number. The lowest stage, stage 0, consists of all entities having no members. We assume that the only entity at stage 0 is the
empty set
In mathematics, the empty set is the unique set having no elements; its size or cardinality (count of elements in a set) is zero. Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in oth ...
, although this stage would include any
urelements we would choose to admit. Stage ''n'', ''n''>0, consists of all possible sets formed from elements to be found in any stage whose number is less than ''n''. Every set formed at stage ''n'' can also be formed at every stage greater than ''n''.
Hence the stages form a nested and
well-ordered
In mathematics, a well-order (or well-ordering or well-order relation) on a set ''S'' is a total order on ''S'' with the property that every non-empty subset of ''S'' has a least element in this ordering. The set ''S'' together with the well-o ...
sequence, and would form a
hierarchy
A hierarchy (from Greek: , from , 'president of sacred rites') is an arrangement of items (objects, names, values, categories, etc.) that are represented as being "above", "below", or "at the same level as" one another. Hierarchy is an important ...
if set membership were
transitive. The iterative conception has gradually become more accepted, despite an imperfect understanding of its historical origins.
The iterative conception of set steers clear, in a well-motivated way, of the well-known
paradox
A paradox is a logically self-contradictory statement or a statement that runs contrary to one's expectation. It is a statement that, despite apparently valid reasoning from true premises, leads to a seemingly self-contradictory or a logically u ...
es of
Russell,
Burali-Forti
Cesare Burali-Forti (13 August 1861 – 21 January 1931) was an Italian mathematician, after whom the Burali-Forti paradox is named.
Biography
Burali-Forti was born in Arezzo, and was an assistant of Giuseppe Peano in Turin from 1894 to 189 ...
, and
Cantor
A cantor or chanter is a person who leads people in singing or sometimes in prayer. In formal Jewish worship, a cantor is a person who sings solo verses or passages to which the choir or congregation responds.
In Judaism, a cantor sings and lead ...
. These paradoxes all result from the
unrestricted use of the principle of comprehension of
naive set theory
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 ...
. Collections such as "the class of all sets" or "the class of all
ordinals" include sets from all stages of the iterative hierarchy. Hence such collections cannot be formed at any given stage, and thus cannot be sets.
Primitive notions
This section follows Boolos (1998: 91). The variables ''x'' and ''y'' range over sets, while ''r'', ''s'', and ''t'' range over stages. There are three
primitive
Primitive may refer to:
Mathematics
* Primitive element (field theory)
* Primitive element (finite field)
* Primitive cell (crystallography)
* Primitive notion, axiomatic systems
* Primitive polynomial (disambiguation), one of two concepts
* Pr ...
two-place
predicates:
* Set–set: ''x''∈''y'' denotes, as usual, that set ''x'' is a member of set ''y'';
* Set–stage: ''Fxr'' denotes that set ''x'' “is formed at” stage ''r'';
* Stage–stage: ''r''<''s'' denotes that stage ''r'' “is earlier than” stage ''s''.
The axioms below include a defined two-place set-stage predicate, ''Bxr'', which abbreviates:
:
''Bxr'' is read as “set ''x'' is formed before stage ''r''.”
Identity, denoted by infix ‘=’, does not play the role in S it plays in other set theories, and Boolos does not make fully explicit whether the background
logic
Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premis ...
includes identity. S has no
axiom of extensionality
In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of extensionality, or axiom of extension, is one of the axioms of Zermelo–Fraenkel set theory. It says that sets having the same elemen ...
and identity is absent from the other S axioms. Identity does appear in the axiom schema distinguishing S+ from S, and in the derivation in S of the
pairing
In mathematics, a pairing is an ''R''-bilinear map from the Cartesian product of two ''R''- modules, where the underlying ring ''R'' is commutative.
Definition
Let ''R'' be a commutative ring with unit, and let ''M'', ''N'' and ''L'' be ''R''- ...
,
null set
In mathematical analysis, a null set N \subset \mathbb is a measurable set that has measure zero. This can be characterized as a set that can be covered by a countable union of intervals of arbitrarily small total length.
The notion of null s ...
, and
infinity
Infinity is that which is boundless, endless, or larger than any natural number. It is often denoted by the infinity symbol .
Since the time of the ancient Greeks, the philosophical nature of infinity was the subject of many discussions am ...
axioms of
Z.
Axioms
The symbolic axioms shown below are from Boolos (1998: 91), and govern how sets and stages behave and interact. The natural language versions of the axioms are intended to aid the intuition.
The axioms come in two groups of three. The first group consists of axioms pertaining solely to stages and the stage-stage relation ‘<’.
Tra:
“Earlier than” is transitive.
Net:
A consequence of ''Net'' is that every stage is earlier than some stage.
Inf:
The sole purpose of ''Inf'' is to enable deriving in S the axiom of infinity of other set theories.
The second and final group of axioms involve both sets and stages, and the predicates other than '<':
All:
Every set is formed at some stage in the hierarchy.
When:
A set is formed at some stage iff its members are formed at earlier stages.
Let ''A''(''y'') be a formula of S where ''y'' is free but ''x'' is not. Then the following axiom schema holds:
Spec:
If there exists a stage ''r'' such that all sets satisfying ''A''(''y'') are formed at a stage earlier than ''r'', then there exists a set ''x'' whose members are just those sets satisfying ''A''(''y''). The role of ''Spec'' in S is analogous to that of the
axiom schema of specification
In many popular versions of axiomatic set theory, the axiom schema of specification, also known as the axiom schema of separation, subset axiom scheme or axiom schema of restricted comprehension is an axiom schema. Essentially, it says that any ...
of
Z.
Discussion
Boolos’s name for
Zermelo set theory
Zermelo set theory (sometimes denoted by Z-), as set out in a seminal paper in 1908 by Ernst Zermelo, is the ancestor of modern Zermelo–Fraenkel set theory (ZF) and its extensions, such as von Neumann–Bernays–Gödel set theory (NBG). It ...
minus extensionality was ''Z-''. Boolos derived in S all axioms of ''Z-'' except the
axiom of choice
In mathematics, the axiom of choice, or AC, 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 ...
. The purpose of this exercise was to show how most of conventional set theory can be derived from the iterative conception of set, assumed embodied in S.
Extensionality
In logic, extensionality, or extensional equality, refers to principles that judge objects to be equal if they have the same external properties. It stands in contrast to the concept of intensionality, which is concerned with whether the internal ...
does not follow from the iterative conception, and so is not a theorem of S. However, S + Extensionality is free of contradiction if S is free of contradiction.
Boolos then altered ''Spec'' to obtain a variant of S he called S+, such that the
axiom schema of replacement
In set theory, the axiom schema of replacement is a schema of axioms in Zermelo–Fraenkel set theory (ZF) that asserts that the image of any set under any definable mapping is also a set. It is necessary for the construction of certain infi ...
is derivable in S+ + Extensionality. Hence S+ + Extensionality has the power of
ZF. Boolos also argued that the
axiom of choice
In mathematics, the axiom of choice, or AC, 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 ...
does not follow from the iterative conception, but did not address whether Choice could be added to S in some way. Hence S+ + Extensionality cannot prove those theorems of the conventional set theory
ZFC whose proofs require Choice.
Inf guarantees the existence of stages ω, and of ω + ''n'' for finite ''n'', but not of stage ω + ω. Nevertheless, S yields enough of
Cantor's paradise to ground almost all of contemporary mathematics.
[”…the overwhelming majority of 20th century mathematics is straightforwardly representable by sets of fairly low infinite ranks, certainly less than ω + 20.” (Potter 2004: 220). The exceptions to Potter's statement presumably include category theory, which requires the weakly ]inaccessible cardinal
In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal is strongly inaccessible if it is uncountable, it is not a sum o ...
s afforded by Tarski–Grothendieck set theory, and the higher reaches of set theory itself.
Boolos compares S at some length to a variant of the system of
Frege’s ''Grundgesetze'', in which
Hume's principle
Hume's principle or HP says that the number of ''F''s is equal to the number of ''G''s if and only if there is a one-to-one correspondence (a bijection) between the ''F''s and the ''G''s. HP can be stated formally in systems of second-order logic. ...
, taken as an axiom, replaces Frege’s Basic Law V, an
unrestricted comprehension
In many popular versions of axiomatic set theory, the axiom schema of specification, also known as the axiom schema of separation, subset axiom scheme or axiom schema of restricted comprehension is an axiom schema. Essentially, it says that any ...
axiom which made Frege's system inconsistent; see
Russell's paradox
In mathematical logic, Russell's paradox (also known as Russell's antinomy) is a set-theoretic paradox discovered by the British philosopher and mathematician Bertrand Russell in 1901. Russell's paradox shows that every set theory that contain ...
.
Footnotes
References
* . Reprinted in: .
* {{Citation , last=Potter , first=Michael , title=Set Theory and Its Philosophy , publisher=Oxford University Press , year=2004 , isbn=9780199269730.
Set theory
Systems of set theory
Z notation