# Difference between revisions of "Hilbert 2nd problem"

a history of the mathematics preceding and relevant to Hilbert’s statement of his 2nd problem, initiating his program for the foundations of mathematics -- see Hilbert problems

By about 1820, mathematicians had developed deductively a large part of analysis using the real numbers and their properties as a starting point.

During the 50 years that followed, in a program that came to be known as the Arithmetization of analysis, Bolzano, Cauchy, Weierstrass, Dedekind, Cantor, and others succeeded in “reducing” analysis to the arithmetic of natural numbers $\mathbb{N}$.

Dedekind himself expressed this as follows:[1]

... every theorem of algebra and higher analysis, no matter how remote, can be expressed as a theorem about natural numbers, -- a declaration I have heard repeatedly from the lips of Dirichlet.

In the final three decades of the 19th century, efforts were underway to axiomatize the whole of mathematics.[2]

It thus became clear that (with the aid of a certain amount of set theoretic and logical apparatus) the entire body of traditional pure mathematics could be constructed rigorously starting from the theory of natural numbers.

These efforts proceeded piecemeal and depended greatly on concurrent developments in logic. The major contributors were these:

• Cantor and Frege in set theory
• Dedekind and Peano in arithmetic
• Hilbert in geometry
• many others in abstract algebras (groups, rings, and fields)

In a 1900 lecture to the International Congress of Mathematicians in Paris, David Hilbert presented a list of open problems in mathematics. The 2nd of these problems, known variously as the compatibility of the arithmetical axioms and the consistency of arithmetic, served as an introduction to his program for the foundations of mathematics.

The article views the 30-year period from 1872 to 1900 as historical background to Hilbert’s program for the foundations of mathematics. There are other, different and equally interesting views of this same period:

• as a continuation and, indeed, culmination of the previous half-century (1822-1872) during which “mathematicians restored and surpassed the standards of rigour” that had long been established, but then neglected, the whole 80-year period called “the formalisation of mathematics.”[3]
• as the first half of the decades-long effort (1872-193X) “from the days of Cantor and Dedekind in the 1870s, through Russell in the 1900s, to the work of Godel in the 1930s” that resulted in the solid establishment of “the modern discipline of foundations.”[4]

However viewed, this 30-year period, from the construction of the real numbers to the Hilbert Problems address, saw “mathematicians of the first rank” engaged with these questions:[5]

• the character of the infinite
• the relationship between logic and arithmetic
• the status of geometry
• the nature of mathematics itself

For a history of the subsequent development of Hilbert’s program for the foundations of mathematics, which was initiated by his 2nd problem, see the article Hilbert program.

## Non-mathematical issues

As is the case for other, especially older programs and periods of mathematics, the history of Hilbert’s program was complicated by non-mathematical issues.[6] Some authors were slow to publish their results; others published only selectively, leaving some important results to be published by students and successors. The works of still others, though published, were partially or completely ignored.

As a first example, consider the work of Galileo. His concerns about the “paradoxical” property of infinite sets are often mentioned in published discussions of the potentially infinite and the actually infinite. Yet, even today, doubts are expressed about whether or not Galileo had influence either on Cantor, the mathematician whose name is most often and most closely associated with the notion of infinite sets, or on any other mathematician.[7]

Further, consider Gauss’ well-known comment about actual infinities in the work of Cantor and the latter’s response:

Gauss: I protest against the use of infinite magnitude as something completed, which in mathematics is never permissible. Infinity is merely a facon de parler, the real meaning being a limit which certain ratios approach indefinitely near, while others are permitted to increase without restriction.
Cantor: I answered [Gauss] thoroughly, and on this point did not accept the authority of Gauss, which I respect so highly in all other areas ...

There is some doubt that even today, 130 years after these words were written, that we really understand properly the meaning either of Gauss’ comment or of Cantor’s response.[8]

Again, consider the work of Bolzano. His paper “Paradoxes of the Infinite” contains some remarkable results related to the theory of infinite sets:[9]

• the word “set” appears here for the first time
• examples of 1-1 correspondences between the elements of an infinite set and the elements of a proper subset

Yet Bolzano himself never published these results. The paper itself was not published until 1851, three years after his death, by one of his students. Further, Cantor appears not to have become aware of Bolzano’s paper until 1882, some years after he began his own work on infinite sets, which was motivated by the Arithmetization of analysis. Nor did Cantor mention Bolzano's paper in his own work until 1883[10] A related historical anomaly is that while Bolzano both knew of and referred to Galileo’s work on the infinite, Cantor did neither.[11]

C S Peirce may hold the record in this regard, having made the following “discoveries in formal logic and foundational mathematics, nearly all of which came to be appreciated only long after he died”:[12]

• In 1860, years before Cantor, “he suggested a cardinal arithmetic for infinite numbers.”
• In 1880–81, anticipating Sheffer by 33 years, he invented the Peirce arrow, a binary operator (logical NOR: “(neither) … nor …”) sufficient in itself for Boolean algebra.
• In 1881, he set out the axiomatization of natural number arithmetic, a few years before Dedekind and Peano.
• In the same paper, years before Dedekind, he gave the first purely cardinal definition of a "Dedekind-finite" set and an (implied) formal definition of a “Dedekind-infinite” set, i.e., one that can be put into a one-to-one correspondence with one of its proper subsets.
• In 1885, he distinguished between first-order and second-order quantification
• In the same paper, anticipating Zermelo by about two decades, he set out what can be read as a (primitive) axiomatic set theory.

As a final example, consider that Frege’s work “seems to have been largely ignored by his contemporaries.”[13][14]

• Three [of six] reviews of the “revolutionary” Begriffsschrift,” including one by no less than Venn, show that their authors were either uninterested in Frege's innovations or had completely misunderstood them.
• The Grundlagen only received a single review, and that one was “a devastatingly hostile” one, by Cantor, whose ideas were [ironically] the closest to Frege's.
• Die Grundgesetze der Arithmetik … except for one review by Peano, was ignored by his contemporaries.

It was not until Russell acknowledged Frege’s work as the trailblazing foundation for the Principia that the greatness of his accomplishment was recognized.[15] Russell himself contrasted the greatness of Frege’s contributions with the limited nature of his influence among his contemporaries as follows:[16]

In spite of the epoch-making nature of [Frege's] discoveries, he remained wholly without recognition until I drew attention to him in 1903.

As a consequence of these and other non-mathematical issues, some mathematical results in the period under examination were achieved multiple times, albeit in slightly different forms or using somewhat different methods, by different authors. Even without the effects of such issues, the mathematics of the past (both long- and recent-past) is still replete with achievements that are said to be “roughly” or “more or less” or “just about” what we know today. About De Morgan’s work on mathematical induction, for example, two types of claims have been made:

1. that he put a process that had been used without clarity on a rigorous basis[17]
2. that he introduced and defined the term “mathematical induction” itself[18]

Yet, another source, citing the contents of De Morgan’s own published papers, has refuted both of these claims.[19]

Finally, a note on some quasi-mathematical matters that are purposely not discussed in this article. Without doubt, positions in the philosophy of mathematics known as Logicism, Formalism, and Intuitionism, along with important methodological and epistemological considerations, grew out of the mathematical practice of the late 19th and early 20th centuries.[20] Further, these philosophical positions were of great interest to some mathematicians and certainly influenced the mathematical problems on which they chose to work. Yet a discussion of either the past origins of or the current nature and status of these philosophical positions would not significantly aid our understanding of the mathematics that resulted from the work of those mathematicians.[21]

Much of the existing literature [of the period surrounding the Hilbert Problems address] has been philosophically motivated and preoccupied with the exegesis of individual thinkers, notably Frege and Russell, who are widely (and rightly) viewed as founding giants of analytical philosophy. But the wider mathematical context has in the process often been lost from sight.

Hence, a discussion of these philosophical positions is not included in this article.

## Introduction of infinite sets

In mathematics, uses of infinity and the infinite (and great concerns about those uses) are as old as Grecian urns. Greek mathematicians followed Aristotle in dividing such uses into two major types, one called “potential infinity”, the other called “actual infinity.”[22]

With respect to magnitudes:[23]

a potential infinity was something endlessly extendible, and yet forever finite;
an actual infinity was something such as the number of points on a line.

Similarly, with respect to sets:

a potentially infinite set was, for example, a finite collection of numbers that can be enlarged as much as one wished
an actually infinite set was, for example, the complete collection of all such natural numbers

Ancient Greek mathematicians developed rigourous methods for using potential infinities. However, with the apparent exception of Archimedes noted below, they avoided using actual infinities.[24] Important early examples of uses of infinity and the infinite include these:

• Euclid skirted the notion of the actually infinitely large in proving that the primes are potentially infinite. This is how he stated his theorem:[25]
Prime numbers are more than any assigned magnitude of prime numbers.
• Archimedes, however, appears to have investigated actually infinite numbers of objects:[26]
... certain objects, infinite in number, are "equal in magnitude" to others [implying] that not all such objects, infinite in number, are so equal. ... [thus] infinitely many objects [of] definite, and different magnitudes … are manipulated in a concrete way, apparently by something rather like a one-one correspondence...

Oresme, an early (12th century) mathematician, examined infinite sets using a method prescient of Cantor’s method of one-to-one correspondence. Oresme demonstrated that two actually infinite sets (the set of odd natural numbers and the set of all natural numbers) could be “different” and “unequal” and yet “equinumerous” with one another. He concluded that notions of equal, greater, and less do not apply to the infinite.[27]

Mathematical induction, as a technique for proving the truth of propositions for an infinite (indefinitely large) number of values, was used for hundreds of years before any rigorous formulation of the method was made[28]

Galileo produced the standard one-to-one correspondence between the positive integers and their squares, reminiscent of Oresme’s work. He termed this a “paradox” that results “unavoidably” from the property of infinite sets and concluded, alike with Oresme, that infinite sets are incomparable.[29]

... the totality of all numbers is infinite, and that the number of squares is infinite.; neither is the number of squares less than the totality of all numbers, nor the latter greater than the former; and, finally, the attributes "equal", "greater", and "less" are not applicable to the infinite, but only to finite quantities.

As recently as 1831, Gauss himself argued against the actually infinite:[30]

I protest against the use of infinite magnitude as something completed, which in mathematics is never permissible. Infinity is merely a facon de parler, the real meaning being a limit which certain ratios approach indefinitely near, while others are permitted to increase without restriction.

For the most part, however, mathematicians of the 19th and 20th centuries developed and readily took up methods for using actual infinities that were as rigorous as those the Greeks developed for potential infinities.[31] Certainly Bolzano had no concerns about the “paradoxical” property of infinite sets. Indeed, his theories of mathematical infinity anticipated Cantor's theory of infinite sets. His contribution to the understanding of the nature of the infinite was threefold:[32]

1. he defined the idea of a set
I call a set a collection where the order of its parts is irrelevant and where nothing essential is changed if only the order is changed.
2. he argued that the infinite set does exist
if the integers are a set, then arbitrarily large subsets of integers are subsets of the set of integers, which must itself be actually infinite
3. he gave examples to show that, unlike for finite sets, the elements of an infinite set could be put in 1-1 correspondence with elements of one of its proper subsets.

The actual infinite is said to have entered algebra in the 1850s in Dedekind’s work with quotient constructions for modular arithmetic:[33]

[T]he whole system of infinitely many functions of a variable congruent to each other modulo p behaves here like a single concrete number in number theory.… The system of infinitely many incongruent classes—infinitely many, since the degree may grow indefinitely—corresponds to the series of whole numbers in number theory.

The five-year period 1868–1872 has been called "the birth of set-theoretic mathematics." A salient milestone was 1871, when Dedekind introduced “an essentially set-theoretic viewpoint … using set operations and … structure-preserving mappings … and terminology that Cantor was later (1880) to use in his own work.[34]

By 1872, procedures involving infinite sets were employed in constructions of irrational real numbers developed during the Arithmetization of analysis by Weierstrass, Dedekind, and Cantor. “Thus analysis [had been reduced] not simply to the theory of natural numbers, but to the theory of natural numbers together with the theory of infinite sets.”[35]

The constructions of Cantor and Dedekind especially relied implicitly on set theory and, further, “involve the assumption of a Power Set principle.”[36]

The realization that (apparently) all the material needed for analysis could be constructed out of the natural numbers using set-theoretic means led to these new questions:[37]

• What further could be said about set-theoretic procedures and assumptions of logic, both of which underlay these accounts of the real numbers?
• Do we have to take the natural numbers themselves as simply given, or can anything further be said about those numbers, perhaps by reducing them to something even more fundamental?

In the 1870s, however, the notions of set and class themselves appeared straightforward. Their highly problematic aspects did not become apparent until the various paradoxes of set theory and the theory of transfinite sets.[38]

## Early development of mathematical logic

The history of logic has been described, “with some slight degree of oversimplification,” as having three stages: (1) Greek logic, (2) Scholastic logic, and (3) mathematical logic.[39] From ancient times through the first half of the 19th century, the state of logic was as follows:[40][41]

• logic was understood to be “the laws of thought”
• the Aristotelian syllogism was the ultimate form of all reasoning
• the logic that a mathematician used did not affect the mathematics that she did

The mathematical context in which logic developed played a role in its shaping. The broad motives behind its development started a two-phased movement:[42]

• initially, there was a great expansion in the scope of logic
• subsequently, a progressive restriction occurred

Both the initial expansion and the subsequent restriction of logic were linked to work in the foundations of mathematics.

The initial expansion of the scope of mathematical logic began during the second half of the 19th century with these two steps:

1. the algebraization of syllogistic logic
2. the development of the predicate calculus

Taken together, these steps accomplished the following:

• they extended the use of symbolism “beyond the subject matter of mathematics, to the reasoning used in mathematics.”[43]
• they provided “the technical basis for … the transition from informal to formal proof.”[44]

Looking back, these developments may seem to us almost natural, perhaps because we know of their beneficial results. Somewhat concurrently, the scope of mathematical logic expanded a step further to include the theories of sets and of relations.[45] This further development, however, was accompanied by highly unexpected and seriously problematic consequences.

## The algebra of logic

The beginning of mathematical logic has been dated from the years in which Boole and De Morgan published their works on the algebraization of Aristotelian logic.[46]

Whereas in [Greek and Scholastic logic] theorems were derived from ordinary language, [mathematical logic] proceeds in a contrary manner—it first constructs a purely formal system, and only later does it look for an interpretation in everyday speech.

Thus, with the advent of mathematical logic, the logic of the syllogism came to be treated as one interpretation of a calculus of logic.

### Syllogistic logic

Aristotle’s system of syllogistic logic is closely linked to the grammatical structure of natural language.[47]

A syllogism is a logical argument consisting (usually) of three statements, one of which (the conclusion) is inferred from the other two (the premises).

Here is an Example Syllogism:

All $Greeks$ are $Sapiens$
All $Sapiens$ are $Mortal$
therefore
All $Greeks$ are $Mortal$

Each statement of this syllogism has two parts: a Subject and a Predicate:

the Subject consists of a Quantifier (All, Some, No, or Not All) and a Common Noun
the Predicate consists of a Copula Verb (are) and a Common Noun

We can think of the Common Nouns in the statements of a syllogism as expressing properties of things or as referring to classes of things that have those properties.

In each syllogism, there is always one Common Noun that occurs in both premises, but not in the conclusion. This Common Noun, which links the two premises of the syllogism, is called the middle term of the syllogism. In the Example Syllogism above, the middle term is the Common Noun “Sapiens”.

A syllogism is valid if the conclusion follows logically from the premises, no matter what Common Nouns are used in its statements; otherwise, the syllogism is invalid. If the syllogism is valid and the premises are true, then the conclusion is true.

The Example Syllogism is valid. Its validity has nothing to do with the particular Common Nouns that are used. If the Common Nouns in the Example Syllogism were replaced by different Common Nouns, the result would still be a valid syllogism. It is the form of the Example Syllogism that makes it valid, not the Common Nouns used in its statements. Replacing the Common Nouns in the Example Syllogism by symbols for classes makes this clear:

All $A$ are $B$
All $B$ are $C$
therefore
All $A$ are $C$

Each statement of a syllogism is one of 4 types, as follows:

A .. All $A$ are $B$
I ... Some $A$ are $B$
E... No $A$ are $B$ (= All $A$ are not $B$)
O... Not All $A$ are $B$ (= Some $A$ are not $B$)

(In ordinary language, the forms E and O have the alternate forms shown. Note that by introducing an additional Copula Verb are not and using the equivalent forms, we can eliminate the Quantifiers No and Not All, reducing them to just All and Some.)

The statements of the Example Syllogism are all of type A and, therefore, the Example Syllogism itself is said to be of type AAA. There are 19 such valid Aristotelian syllogistic types.

### Peacock's and De Morgan’s contributions

Even before Boole’s and De Morgan's work, important steps were taken towards the development of a calculus of logic. As early as 1830, Peacock suggested that the symbols for algebraic objects need not be understood only as numbers.[48][49]

'Algebra' … has been termed Universal Arithmetic: but this definition is defective, in as much as it assigns for the general object of the science, what can only be considered as one of its applications.

In his treatise, Peacock distinguished between arithmetical algebra, with laws derived from operations on numbers, and symbolic algebra, which he describes as follows:[50]

the science which treats the combinations of arbitrary signs and symbols by means defined through arbitrary laws…. We may assume any laws for the combination and incorporation of such symbols, so long as our assumptions are independent, and therefore not inconsistent with each other.

In 1847, De Morgan extended Peacock’s vision for a symbolic algebra with the notion that the interpretations not only of symbols for algebraic objects, but also of symbols for algebraic operations were arbitrary.[51]

De Morgan’s contribution to logic was twofold. First, he insisted on the purely formal or, as he put it, “symbolic” nature of algebra, the study of which has as it object “symbols and their laws of combination, giving a symbolic algebra which may hereafter become the grammar of a hundred distinct significant algebras.”[52][53] Consider his example of a commutative algebra to which he provided five interpretations, among which are the three listed:[54]

Given symbols M, N, +, and one sole relation of combination, namely that M + N is the same as N + M:
1. M and N may be magnitudes, and + the sign of addition of the second to the first
2. M and N may be numbers, and + the sign of multiplying the first to the second
3. M and N may be nations, and + the sign of the consequent having fought a battle with the antecedent

Second, De Morgan clarified the nature of logical validity as “that part of reasoning which depends upon the manner in which inferences are formed…. Whether the premises be true or false, is not a question of logic…. the question of logic is, does the conclusion certainly follow if the premises be true?”[55]

### Boole’s algebra of logic

Both Boole and De Morgan were aware of the limitations of syllogistic logic, in particular, that there were inferences known to be valid, but whose validity could not be demonstrated by syllogistic logic. Their intent was to develop “a general method for representing and manipulating all logically valid inferences.”[56] The significant difference in Boole’s approach from De Morgan's was the algebraic methods that Boole adopted.

In 1847, in “a little book that De Morgan himself recognized as epoch-making,” Boole undertook the following:[57][58]

• the goal: “to express traditional logic more perspicuously using the techniques of algebra” such that deduction becomes calculation
• the program: to develop an algebraic calculus and show that the doctrines of traditional logic can be expressed using this calculus.

In this early work, Boole extended De Morgan’s view about the formal nature of algebra by presenting the view that the essential character of the whole of mathematics is formal, somewhat as follows:[59]

If any topic is presented in such a way that it consists of symbols and precise rules of operation upon these symbols, subject only to the requirement of inner consistency, this topic is part of mathematics.

In 1854, Boole published a second book, the completion of his efforts “to incorporate logic into mathematics by reducing it to a simple algebra, pointing out the analogy between algebraic symbols and those that represent logical forms, and beginning the algebra of logic that came to be called Boolean algebra.”[60]

Boole eventually gave his uninterpreted calculus three interpretations, in terms of classes, of probabilities, and also of propositions. These various interpretations were possible because of analogies among the concepts of a class, an event, and a statement. As a consequence, the "order" relation in a Boolean algebra can be interpreted variously as set-theoretical inclusion, as causal follow-up of events, as logical follow-up of statements.[61] A modified version of the third interpretation of his calculus became modern propositional logic. This latter is today the lowest level of modern logic, but at the time and in effect, it was all of logic, because it was able to be used for Aristotelian syllogistic logic:[62]

• it used symbols for statements rather than numbers
• it defined operations on statements rather than on numbers
• it defined deductions as equations and as the transformation of equations

Boole’s second (1854) book was an effort “to correct and perfect” his first. He introduced the formalisms of his algebra, including these:[63]

• Classes were $x, y, z$.
• There was a universal class $1$ and an empty class $0$.
• Multiplication $x \cdot y$ was intersection, yielding $x \cdot y = y \cdot x$.
• Next, he gave the idempotent law $x \cdot x = x$.
• Addition $x+y$ was aggregation (for $x, y$ disjoint), yielding $x + y = y+x$ and $z(x + y) = z \cdot x + z \cdot y$.
• Also, $x − y = − y + x$ and $z(x − y) = z \cdot x − z \cdot y$.

Boole did not, however, go on from all of this to build an axiomatic foundation for his algebra of logic. Instead, he introduced three theorems (Expansion, Reduction, Elimination) and used them in his “General Method” for analyzing syllogistic arguments.

Boole's introduction of an Elimination theorem is interesting as an example of his commitment to an algebraic approach to logic. As shown in the Example Syllogism above, the middle term of a syllogism is a Common Noun that occurs in both of the premises. In effect, it links the two other Common Nouns of the syllogism, allowing them to be joined in the conclusion. Observing this, Boole reasoned that syllogistic logic produces a conclusion by eliminating that middle term, so he introduced into his algebra of logic an Elimination theorem, which he borrowed from the ordinary algebraic theory of equations.[64]

The final version of Boole’s method “for analyzing the consequences of propositional premises,” briefly stated, is as follows:[65]

1. convert (or translate) the premise statements of the syllogism into equations,
2. apply a prescribed sequence of algebraic processes to the equations, including application of the three theorems mentioned above, yielding equational conclusions
3. convert the equational conclusions into statements, yielding the desired conclusions of the syllogism.

With this method Boole had replaced the art of reasoning from premise statements to conclusion statements by a routine mechanical algebraic procedure.

Boole showed, with somewhat mixed results, that his algebra provided “an easy algorithm for syllogistic reasoning,” an elementary example of which is as follows:[66][67]

an Aristotelian syllogism of the AAA type:
(1) $\text{All } A \text{ are } B$ .... $A \cdot B = A$
(2) $\text{All } B \text{ are } C$ .... $B \cdot C = B$
(3) ........................... $A (B \cdot C) = A$ .... substituting in (1) the value of $B$ given by (2)
(4) ........................... $(A \cdot B)C = A$ .... applying associative law for multiplication
(5) $\text{All } A \text{ are } C$ .... $A \cdot C = A$ ........... substituting in (4) the value of $AB$ from (1)

No less than De Morgan himself praised Boole’s work as a remarkable proof that “the symbolic processes of algebra, invented as tools of numerical calculation, [are] competent to express every act of thought, and to furnish the grammar and dictionary of an all-containing system of logic.”[68]

Taken at face value, De Morgan’s praise overstated the adequacy of Boole’s logic of propositions without quantification, in two ways:

1. it was inadequate to express some important statements of mathematics such as the law of mathematical induction, on which De Morgan himself had worked;
2. it was also inadequate to express some statements of ordinary language with a form such as, “If all horses are animals, then all heads of horses are heads of animals.”

In fact, this example was De Morgan’s own, intended “to show the inadequacy of traditional logic” and that, for a logic adequate to express this example, “binary relations are essential.”[69] If, however, we take De Morgan’s comment to be about some yet-to-be-developed logic with quantification, then we can accept that his optimism about Boole's calculus was not misplaced.

### Jevons and De Morgan’s extensions

For three decades after Boole introduced his calculus in 1847, “most researchers interested in formal logic worked on extending and improving [his] system.”[70]

In 1864, Jevons published an alternative system of algebraic logic, retaining Boole’s use of algebraic equations as the basic form of logical statements, but rejecting Boole’s desire to retain “dependence on” the ordinary algebra of numbers. More generally, Jevons replaced the use of classes (associated with quantity) with predicates (associated with quality).[71]

Both Boole and Jevons understood logic to be an expression of “the laws of thought.” Yet Boole had more of an algebraic concept of logic and saw deduction as calculation, while Jevons argued that mathematics proceeds from logic, seeing calculation as deduction.[72] Further on, we shall see that, alike with Jevons, Frege envisions logic as a predicate-based foundation to mathematics, though his method of realizing this vision are not algebraic, but axiomatic.

De Morgan himself extended Boole’s calculus with a law of duality that asserts for every theorem involving addition and multiplication, there is a corresponding theorem in which the words addition and multiplication are interchanged.[73]

Interpreted as a logic of classes, we have this:

If $x$ and $y$ are subsets of a set $S$, then
• the $complement$ of the $union$ of $x$ and $y$ is the $intersection$ of the $complements$ of $x$ and $y$
• the $complement$ of the $intersection$ of $x$ and $y$ is the $union$ of the $complements$ of $x$ and $y$

Interpreted as a logic of propositions, we have this:

If $p$ and $q$ are propositions, then
• $\text{not} (p \text{ or } q)$ equals $\text{not } p \text{ and not } q$
• $\text{not } (p \text{ and } q)$ equals $\text{not } p \text{ or not } q$

### C S Peirce’s logic

Peirce was convinced of the general notion that "Mathematics is the science which draws necessary conclusions."[74] Further, he was “committed to the broadly ‘algebraic’ tradition' of his father, Benjamin, and of his colleague, Boole. It is not surprising that, on reading of Frege’s belief that mathematics could be derived from logic, Peirce responded that logic was properly seen as a branch of mathematics, not vice versa.[75]

Though De Morgan had clearly located the inadequacy of syllogistic logic in its inability to express binary relations, he himself lacked “an adequate apparatus for treating the subject.” The title “creator of the theory of relations” has been awarded to C. S. Peirce.[76]

In several papers published between 1870 and 1882, [Peirce] introduced and made precise all the fundamental concepts of the theory of relations and formulated and established its fundamental laws … in a form “much like the calculus of classes developed by G. Boole and W. S. Jevons, but which greatly exceeds it in richness of expression.”

In a series of papers, Peirce introduced his “claw” symbolism $\prec$ and used it to develop his logic of inferences:[77]

• he defined $\prec$ as follows:
$A \prec B$ is explicitly defined as $A \text{ implies } B$, and ::$A \overline{\prec} B$ defines $A \text{ does not imply } B$. * he defined illation (material implication or logical inference) as follows: ::# $A \prec A$, whatever $A$ may be. ::# If $A \prec B$, and $B \prec C$, then $A \prec C$. * he distinguished universal and particular propositions, affirmative and negative, according to the following scheme: ::* '''A''' $a \prec b$ All A are B (universal affirmative) ::* '''E''' $a \prec \bar{b}$ No A is B (universal negative) ::* '''I''' $\bar{a} \prec b$ Some A is B (particular affirmative) ::* '''O''' $\bar{a} \prec \bar{b}$ Some A is not B (particular negative) By means of all the above, Peirce transformed the Aristotelian syllogism into a hypothetical proposition, “with material implication as its main connective.” For example, he symbolized the syllogistic form '''AAA''' of our Example Syllogism (discussed previously) as follows:'"UNIQ--ref-0000004D-QINU"' ::If $x \prec y$, and $y \prec z$, then $x \prec z$. Comparing Peirce’s formalism above with the remarkably similar formalism of the familiar Peano-Russell notation below ::$(x ⊃ y) ⋅ (y ⊃ z)] ⊃ (x ⊃ y)$. it is difficult to conclude other than that “the differences are entirely and solely notational.”'"UNIQ--ref-0000004E-QINU"' Here is a succinct summary of how syllogistic logic was transformed by the algebraic tradition:'"UNIQ--ref-0000004F-QINU"' * Aristotle’s syllogistic logic, entirely linguistic, was a ''logic of terms'' in whose sentences of a subject-predicate syntax were connected by a ''copula of existence'' concerns the inherence of a property, whose reference is the predicate, in a subject; * Boole’s formal logic, expressed algebraically, was a ''logic of classes'' that were connected by a ''copula of class inclusion''; * De Morgan’s formal logic, also algebraic, was a ''logic of relations'' whose relata were connected by a ''copula of relations''. * Peirce’s formal logic was a ''logic of inference'' that took in, combined, and went beyond each of these. His terms (of syllogisms), classes, and propositions were connected by a ''copula of illation''. Subsequently, Peirce extended his logic into a predicate calculus by adding a theory of quantification to his logic of relations -- see [[#Peirce.27s logic of quantifiers|Peirce's logic of quantifiers]]. Peirce's work on (binary) relations and quantification was continued and extended in a very thorough and systematic way by Schröder, whose published work of 1895 was lauded in 1941 as “so far the only exhaustive account of the calculus of relations.”'"UNIQ--ref-00000050-QINU"' =='"UNIQ--h-9--QINU"'Cantor’s early theory of sets== Set theory is the study sets, their properties, and the operations that can be performed on them. It has been especially concerned with sets that have infinitly many elements.'"UNIQ--ref-00000051-QINU"' Broadly defined, the term ''naive set theory'' connotes an informal set theory developed in a natural language in which such words as and, or, if ... then, not, for some, and for every are not rigorously defined. The term includes these various versions of set theory:'"UNIQ--ref-00000052-QINU"''"UNIQ--ref-00000053-QINU"' # Cantor’s early (pre-1883 ''Grundlagen'') theory of sets # Cantor’s later general theory of sets, the basis of the theory of transfinite numbers # informally developed set theories (axiomatic or otherwise) developed by Dedekind, Peano, and Frege # modern, informally developed versions of an axiomatic set theory, as in ''Naive Set Theory'' by Paul Halmos. This section examines the first of these, namely, Cantor’s early theory of sets. ==='"UNIQ--h-10--QINU"'Bolzano’s contribution=== In spite of Cantor’s pre-eminence in the area of set theory, the first to work with sets was Bolzano, as was noted above in [[#Introduction of infinite sets|Introduction of infinite sets]]. It is from him that we have the following early definitions: ::... an embodiment of the idea or concept which we conceive when we regard the arrangement of its parts as a matter of indifference (1847)'"UNIQ--ref-00000054-QINU"' ::... an aggregate so conceived that it is indifferent to the arrangement of its parts (1851)'"UNIQ--ref-00000055-QINU"' It was also Bolzano who first used the German word ''Menge'' for set, a usage that Cantor himself continued in his theory.'"UNIQ--ref-00000056-QINU"' Despite this, Bolzano’s understanding of the notion of set was incomplete, especially with respect to the important distinction between the element/set relation and the part/whole relation. Consider, as evidence, his use of the word “parts” (''Teile'') to refer to the elements of a set in his description given above.”'"UNIQ--ref-00000057-QINU"' Further, Bolzano thought absurd consideration of a set with only one element, while he failed entirely to consider the null set.'"UNIQ--ref-00000058-QINU"' Nevertheless, it was Bolzano who identified sets as “the carriers of the property finite or infinite in mathematics.”'"UNIQ--ref-00000059-QINU"' ==='"UNIQ--h-11--QINU"'Cantor’s discoveries=== Traditional views give to Cantor (not entirely undeservedly) all or most of the credit for having developed set theory: ::naive set theory is primarily due to Cantor'"UNIQ--ref-0000005A-QINU"' ::the first development of set theory was a naive set theory … created at the end of the 19th century by Georg Cantor.'"UNIQ--ref-0000005B-QINU"' ::“For most areas [of mathematics] a long process can usually be traced in which ideas evolve until an ultimate flash of inspiration, often by a number of mathematicians almost simultaneously, produces a discovery of major importance. Set theory however is rather different. It is the creation of one person, Georg Cantor.”'"UNIQ--ref-0000005C-QINU"' ::Set theory, as a separate mathematical discipline, was born in late 1873 in the work of Georg Cantor.'"UNIQ--ref-0000005D-QINU"' To this needs to be added a nuanced caveat, such as these: ::Cantor’s work should be considered as a completion of a long historical process'"UNIQ--ref-0000005E-QINU"' ::The concept of set is no Athena: school children understand it now; but its development was long drawn out, beginning with the earliest counting and reckoning and extending into the late nineteenth century.'"UNIQ--ref-0000005F-QINU"' Even today, it is known that early study of naive set theory and early work with naive sets are useful in mathematics education:'"UNIQ--ref-00000060-QINU"' * they aid in developing a facility for working more formally with sets * they aid in understanding the motivation for axiomatic set theory Cantor’s first ideas on set theory were contained in papers on trigonometric series, but for the most part he developed the set concept and its theory as a consistent basis for his work with infinite sets.'"UNIQ--ref-00000061-QINU"''"UNIQ--ref-00000062-QINU"' In 1873, he discovered that the linear continuum is not countable, which he treated as an invitation to investigate the “different sizes of infinity” and the domain of the transfinite.'"UNIQ--ref-00000063-QINU"''"UNIQ--ref-00000064-QINU"' The following is a brief account of how his discovery came about:'"UNIQ--ref-00000065-QINU"' ::* Cantor, in correspondence with Dedekind, asked the question whether the infinite sets N of the natural numbers and R of real numbers can be placed in one-to-one correspondence. ::* Dedekind, in reply, offered a proof of the following: ::::the set $\mathbb{A}$ of all algebraic numbers, the set of all real roots of equations of the form an $x_n + a_{n-1} x_{n-1} + a_{n-2} x_{n-2} + . . . + a_1 x + a_0 = 0$, where $a_i$ is an integer, is denumerable (i.e., there is a one-to-one correspondence with $\mathbb{N}$). ::* Cantor, a few days later, proved that the assumption that $\mathbb{R}$ is denumerable leads to a contradiction, using the Bolzano-Weierstrass principle of completeness. Thus, Cantor showed that “there are more elements in $\mathbb{R}$ than in $\mathbb{N}$ or $\mathbb{Q}$ or $\mathbb{A}$,” in this precise sense: ::::the cardinality of $\mathbb{R}$ is strictly greater than that of $\mathbb{N}$. A consequence of all this, Cantor noted, was proving anew an old (1844) result of Liouville's, namely, the existence (in every interval) of (uncountably many) transcendental numbers. In effect, there are in any real interval, more transcendental numbers than algebraic numbers.'"UNIQ--ref-00000066-QINU"''"UNIQ--ref-00000067-QINU"' In 1874, ''Crelle’s Journal'' published Cantor’s paper reporting this remarkable result and, in doing so, marked the birth of set theory. Previously, all infinite collections were assumed to be of "the same size." Cantor invoked the concept of a 1-to-1 correspondence to show that “there was more than one kind of infinity.”'"UNIQ--ref-00000068-QINU"''"UNIQ--ref-00000069-QINU"''"UNIQ--ref-0000006A-QINU"' Here is a summary of Cantor’s published results involving the early version of his naive set theory:'"UNIQ--ref-0000006B-QINU"''"UNIQ--ref-0000006C-QINU"' # in 1874, a proof that the set of real numbers is not denumerable, i.e. is not in one-to-one correspondence with (is not equipollent to) the set of natural numbers. # in 1878, a definition of what it means for two sets M and N to have the same power or cardinal number; namely that they be equipollent. # also in 1878, a proof that the set of real numbers and the set of points in n-dimensional Euclidean space have the same power, using a precisely developed notion of a one-to-one correspondence. Cantor actually achieved this last result -- at the time quite paradoxical -- in 1877, after which he wrote to Dedekind to report it, saying “I see it, but I don't believe it!”'"UNIQ--ref-0000006D-QINU"' There were others who really didn’t believe it! Cantor submitted a paper reporting the result to ''Crelle's Journal''. Kronecker, who had significant influence over what was published in the journal, disliked much of Cantor's set theory and fundamentally disagreed with Cantor's work with infinite sets. The paper was published only after Dedekind intervened on Cantor's behalf.'"UNIQ--ref-0000006E-QINU"' In 1878, Cantor stated his [[Continuum hypothesis|Continuum Hypothesis]], asserting that every infinite set of real numbers is either countable, i.e., it has the same cardinality as $\mathbb{N}$, or has the same cardinality as $\mathbb{R}$. From that point until 1883, these were the only two infinite powers or cardinal numbers.'"UNIQ--ref-0000006F-QINU"' In all of these early papers, up to his development of the theory of transfinite numbers in 1883, Cantor’s notion of a set was essentially as follows:'"UNIQ--ref-00000070-QINU"' ::a set is a collection of elements that constitute the extension of a (mathematical) concept with the further important understanding that ::the concept involved is defined only for objects of some given (mathematical) domain. With the proviso noted, we can make these further points about this:'"UNIQ--ref-00000071-QINU"' * Cantor’s early notion is the notion of set as it is most often applied in mathematics * the proviso noted ensures that the paradoxes of set theory simply do not arise Finally, in an 1882 paper, Cantor made the following point with respect to what were termed “undecidable” concepts:'"UNIQ--ref-00000072-QINU"' ::an algorithm for deciding whether or not the concept determining a set applies to any particular object in the given domain is not needed for the concept to be the basis of a well-defined set. He gives, as an example, the set of algebraic numbers, which (as mentioned above) he himself had determined was countable. This set, Cantor insisted, is well-defined, even though determining whether or not a particular real number is algebraic “may or may not be possible at a given time with the available techiniques.” ==='"UNIQ--h-12--QINU"'Two presentations of naive set theory=== ''Set theory'' begins with two fundamental notions, ''objects'' and ''sets'' of those objects.'"UNIQ--ref-00000073-QINU"' ''Membership'' is a fundamental binary relation between objects $o$ and sets $A$. If $o$ is a ''member'' (or element) of $A$, write $o \in A$. ''Set inclusion'' is a derived binary relation between two sets. If all the members of set $A$ are also members of set $B$, then $A$ is a '''subset''' of $B$, denoted $A \subseteq B$. $A$ is called a '''proper subset''' of $B$ if and only if $A$ is a subset of $B$, but $B$ is not a subset of $A$. Set theory features binary operations on sets, such as these: * ''Union'' of the sets $A$ and $B$, denoted $A \cup B$, is the set of all objects that are a member of $A$, or $B$, or both. * ''Intersection'' of the sets $A$ and $B$, denoted $A \cap B$, is the set of all objects that are members of both $A$ and $B$. * ''Set difference'' of $U$ and $A$, denoted $U \setminus A$, is the set of all members of $U$ that are not members of $A$. When $A$ is a subset of $U$, the set difference $U \setminus A$ is also called the complement of $A$ in $U$. In this case, if the choice of $U$ is clear from the context, the notation $A^c$ is sometimes used instead of $U \setminus A$. * ''Symmetric difference'' of sets $A$ and $B$, denoted $A \bigtriangleup B$ or $A \ominus B$, is the set of all objects that are a member of exactly one of $A$ and $B$ (elements which are in one of the sets, but not in both). It is the set difference of the union and the intersection,$(A \cup B) \setminus (A \cap B)$ or $(A \setminus B) \cup (B \setminus A)$. * ''Cartesian product'' of $A$ and $B$, denoted $A \times B$, is the set whose members are all possible ordered pairs $(a,b)$ where $a$ is a member of $A$ and $b$ is a member of $B$. * ''Power set'' of a set $A$ is the set whose members are all possible subsets of $A$. - - - - - Beginning with the fundamental notions of ''set'' and ''belongs to'' or ''is a member of'' and assuming that sets have properties usually associated with collections of objects, Paul Halmos, in his 1960 text, developed informally an axiomatic set theory that presented the binary relation of set inclusion and the binary operations noted above, as follows:'"UNIQ--ref-00000074-QINU"' # ''Axiom of Extension'': Two sets are equal if and only if they have the same elements. # ''Axiom of Specification'': For every set $S$ and every proposition $P$, there is a set which contains those elements of $S$ which satisfy $P$ and nothing else. # ''Axiom of Pairs'': For any two sets there is a set which contain both of them and nothing else. # ''Axiom of Union'': For every collection of sets, there is a set that contains all the elements and only those that belong to at least one set in the collection. # ''Axiom of Powers'': For each set $A$ there is a collection of sets that contains all the subsets of the set $A$ and nothing else. # ''Axiom of Infinity'': There is a set containing $0$ and the $successor$ of each of its elements. # ''Axiom of Choice'': The Cartesian product of a non-empty indexed collection of non-empty sets is non-empty. In addition, there is an axiom stipulating (more or less) that anything intelligent one can do to the elements of a set yields a set: :8. ''Axiom of substitution'': If $S(a,b)$ is a sentence such that for each $a$ in set $A$ the set $\{b: S(a,b)\}$ can be formed, then there exists a function $F$ with domain $A$ such that ::::$F(a) = \{b:S(a,b)\}$ for each $a$ in $A$. An informally developed naive set theory with these axioms is equipped to do the following:'"UNIQ--ref-00000075-QINU"' * develop concepts of ''ordered pair'', ''relation'', and ''function'', and to discusses their properties * discuss ''numbers'', ''cardinals'', ''ordinals'', and their arithmetics, * discuss different kinds of ''infinity'', in particular, the uncountability of the set of real numbers ==='"UNIQ--h-13--QINU"'Paradoxes and Cantor’s early set theory=== A discussion of paradoxes is relevant in two ways to the theory of sets: * the “paradoxes of the infinite” that had to be overcome before set theory could be developed * the paradoxes that later arose out of the development of set theory itself It is interesting to consider that Cantor succeeded in resolving the “paradoxes of the infinite” and providing a coherent account of cardinal number for infinite multiplicities, while Bolzano, though he made great progress with the use and understanding of sets, failed to do so. Two points have been made to account for this. First, there were notions about which, when applied to infinite sets, Bolzano was confused:'"UNIQ--ref-00000076-QINU"' * the cardinal number of the set of points in an interval * the magnitude of the line interval as a geometric object Cantor accepted for infinite sets what had long been accepted for finite sets, namely, that “the relation of having the same cardinal number is defined in terms of equipollence.” Thus, since “the interval (0, 1) of real numbers is equipollent to the ‘larger’ interval (0, 2),” then these two sets of points, though different in magnitude, nevertheless have the same cardinal number. Bolzano, along many, rejected this.'"UNIQ--ref-00000077-QINU"' Second, Euclid’s Common Notion 5, that ''the whole is greater than the part'', was a barrier to working with infinite sets. Euclid’s principle does indeed apply to geometric magnitude. It may be that Cantor’s clear understanding of the first point above allowed him to see that in the domain of sets, infinite sets are simply a counterexample to Euclid’s principle. Whatever the reason, Bolzano did not see this.'"UNIQ--ref-00000078-QINU"' As a final issue, it is worth commenting on the oft-repeated claim that working with naive set theory inexorably leads one to paradoxes. One such claim is the following:'"UNIQ--ref-00000079-QINU"' ::Naïve set theory is intuitive and simple, but unfortunately leads very soon to controversial statements [, because] it relies on an informal understanding of sets as collections of objects, called the elements or members of the set, that is [, it relies] on a predicate indicating that a collection is a set and a relation type symbol to represent set membership. This claim, however, does not apply to Cantor’s early theory of sets, which is the naive set theory that we have been examining. Certainly an aspect of set theory (naive or otherwise) that can lead to controversy and paradoxes is the use of ''unrestricted'' predicates (properties/concepts) to determine sets. Cantor’s early theory of sets, however, determines sets using ''restricted'' concepts. It is worth repeating here Cantor’s early notion of set: ::a set is a collection of elements that constitute the extension of a (mathematical) concept that is defined only for objects of some given (mathematical) domain. Sets determined in accordance with such a notion do not give rise to paradoxes. =='"UNIQ--h-14--QINU"'Dedekind’s theory of sets== The intention to get rid of geometrical intuitions as a genuine source of mathematical knowledge was the impetus for the two great programs of 19th century mathematics: rigorization and foundations.'"UNIQ--ref-0000007A-QINU"''"UNIQ--ref-0000007B-QINU"' ::[...] There is a natural transition from the arithmetization of analysis that came to fruition in the 1870’s to interest in the foundations of arithmetic that flowered in the 1880’s. Dedekind played a major role in both of these programs. One goal of his was to examine set-theoretic procedures and their connections to the assumptions of logic.'"UNIQ--ref-0000007C-QINU"' ==='"UNIQ--h-15--QINU"'Dedekind's “logic”=== In 1888, Dedekind published his major work on the foundations of arithmetic. For him, sets were logical objects and the corresponding notion was a fundamental concept of logic.'"UNIQ--ref-0000007D-QINU"' In fact, he identified three basic logical notions:'"UNIQ--ref-0000007E-QINU"' ::# object (“Ding”) ::# set (or system, “System”) ::# function (mapping, “Abbildung”) He held these logical notions to be “fundamental for human thought” and yet, at the same time, “capable of being elucidated,” in part, by “observing what can be done with them, including how arithmetic can be developed in terms of them.” Dedekind, emphasizing that both sets and functions were to be defined extensionally, connected his three notions of logic as follows:'"UNIQ--ref-0000007F-QINU"' ::“sets are a certain kind of object ... about which we reason by considering their elements, and this is all that matters about sets.” ::functions, arbitrary ways of correlating the elements of sets, are yet not reducible to sets; neither are they presented by formulas nor representable in intuition (via graphs) nor decidable by formal procedures. Dedekind defined the concept of infinity using his three basic (undefined) notions of logic along with definable notions, such as subset, union, and intersection:'"UNIQ--ref-00000080-QINU"' ::a set of objects is infinite … if it can be mapped one-to-one onto a proper subset of itself. Dedekind’s theory of sets (systems) … made an appeal (for the most part implicit -- but see below) to a principle of unrestricted comprehension, a principle according to which every condition defines a set.'"UNIQ--ref-00000081-QINU"' Dedekind accepted “general notions of set and function and the actual infinite.” His notion of set was “unrestricted” in these three senses:'"UNIQ--ref-00000082-QINU"' # it involved an implicit acceptance of a general comprehension principle # it involved a universal set: “the totality of all things that can be objects of my thought” -- the ''Gedankenwelt'' # it involved consideration of arbitrary subsets of that totality -- a general ''Aussonderungsaxiom'' Dedekind’s presentations proceeded informally. He presented his theory using some formal machinery, though without a great deal of precision and explicitness, but he provided no explicit list of axioms or rules of inference. '"UNIQ--ref-00000083-QINU"''"UNIQ--ref-00000084-QINU"' ::Dedekind ... has not [an] over-ruling passion … to demonstrate his position conclusively, and is content with the usual informal mathematical standard of rigour. As a result, [however,] his work has … mathematical elegance [absent in more formal presentations]. Frege himself commented on Dedekind’s book as follows:'"UNIQ--ref-00000085-QINU"' # his expressions set and belongs to “are not usual in logic and are not reduced to acknowledged logical notions” # an inventory of the logical laws taken by him as basic is nowhere to be found.” The first remark is fair comment, but the second “is not altogether true”:'"UNIQ--ref-00000086-QINU"' ::Dedekind does state some of the basic principles of set theory, which for him are part of logic. Such a view of sets leads rather to axiomatic set theory than to higher-order logics.'"UNIQ--ref-00000087-QINU"' All of this is in keeping with Dedekind’s ultimate purpose, which was not to axiomatize arithmetic, but to define mathematical notions in terms of logical ones.'"UNIQ--ref-00000088-QINU"' Judged retrospectively, [Dedekind’s] contributions belong more to modern mathematics and algebra than to mathematical logic narrowly construed.'"UNIQ--ref-00000089-QINU"' ==='"UNIQ--h-16--QINU"'Two versions of Dedekind’s principles=== Dedekind stated various principles satisfied by his notion of set.'"UNIQ--ref-0000008A-QINU"' “These principles are not explicitly introduced as axioms, but they nonetheless bear a close relation to the later axioms of set theory.”'"UNIQ--ref-0000008B-QINU"' The notion of set: different things $a, b, c$ can be considered from a common point of view … and we say that they form a set (system) # the set $S$ is the same as the set $T$ ($S = T$) when every element of $S$ is also an element of $T$” [and vice versa] # a set $A$ is said to be a subset (part) of a set $S$ when every element of $A$ is also [an] element of $S$. Unfortunately, in discussing this concept, Dedekind fails somewhat to distinguish the two notions member and subset, thereby “identifying an element $s$ with its unit set ${s}$.”'"UNIQ--ref-0000008C-QINU"' # the empty set $\emptyset$ is “wholly excluded” from Dedekind’s logic for “certain reasons.”'"UNIQ--ref-0000008D-QINU"' # the Union of any arbitrary sets $A, B, C, …$ is defined # the Intersection of any sets $A, B, C, …$ is defined, with the proviso that the sets have at least one common element -- arising from the absence of the empty set! # the principle of Comprehension is not stated, but is assumed implicitly and is appealed to explicitly in the proof of one Dedekind’s theorems, which contains the following text: “If we denote by 𝐄 the set of all things possessing the property 𝜠….” # a set is infinite (said to be Dedekind-infinite) if it can be put in 1-1 correspondence with (is similar to) a proper subset of itself; otherwise it is finite. - - - - - The above principles of Dedekind’s logical framework “bear a remarkably close relationship to [the axioms of] modern axiomatic set theory,” devised by Zermelo and set out below.'"UNIQ--ref-0000008E-QINU"' The notes to the axioms show connections to Dedekind’s Principles. ''Set'' is an undefined notion, introduced as follows: Set theory is concerned with a domain B of individuals, which we shall call simply objects and among which are the sets. * I ''Axiom of Extensionality'': sets are defined by their members -- Dedekind’s Principle 1 * II ''Axiom of 'Elementary Sets'': **(a) ''the empty set'' -- Dedekind's Principle 3 **(b) ''the unit set'' $\{a\}$ of $a$ **(c) ''the unordered pair set'' $\{a,b\}$ of any objects $a, b$ * III ''Axiom of Separation'': This axiom and parts (b) and (c) of Axiom II replace an intuitive (naive) ''Axiom of Comprehension'', stating given any property there exists the set of all things having that property and (unfortunately) leading directly to Russell’s paradox -- Dedekind's Principle 6 * IV ''Axiom of Power Set'': to every set $A$ there corresponds the set of all subsets of $A$, $P(A)$ -- Dedekind does not deal with infinite sets, so does not need the concept of Power Set * V ''Axiom of Union'': -- Dedekind’s Principle 4. A special axiom for Intersection is not needed, since it follows from the other axioms. * VI ''Axiom of Choice'': needed to prove that sets ''ordinary-infinite'' are also ''Dedekind-infinite'' -- Dedekind's Principle 7 * VII ''Axiom of Infinity'': Dedekind's Principle 7 -- “essentially due to Dedekind” owing to his failure to prove the existence of an infinite set =='"UNIQ--h-17--QINU"'The predicate calculus== For millennia mathematics had been a science based on deductive logic. But no account of logic had ever been produced which was adequate for the purposes of mathematics.'"UNIQ--ref-0000008F-QINU"' The logic of propositions, for example, was not powerful enough either to represent all types of assertions used specifically in mathematics or to express certain types of equivalence relationships that hold generally between assertions. Consider the following two examples:'"UNIQ--ref-00000090-QINU"' 1. Assertions such as $x \text{ is greater than } 1$, where $x$ is a variable, appear quite often in mathematical inferences. :However, the logic of propositions can deal with such assertions only when stated with an explicit value for $x$, such as $2 \text{ is greater than } 1$. Otherwise, such assertions are not propositions: until the value of $x$ is explicitly stated, they are neither true nor false. 2. The patterns involved in the following logical equivalences are common in inferences: ::* "Not all birds fly" is equivalent to "Some birds don't fly" ::* "Not all integers are even" is equivalent to "Some integers are not even" ::* "Not all cars are expensive" is equivalent to "Some cars are not expensive" :However, the logic of propositions treats the two assertions in such equivalences independently. ::Let $P$ represent "Not all birds fly" and $Q$ represent "Some integers are not even" ::There is no general mechanism in the logic of propositions to determine whether or not $P$ is equivalent to $Q$. Each such equivalence must be listed individually to be used in inferencing. :Instead, we want to have a rule of inference that covers all these equivalences collectively and can be used when necessary. In other words, we need a more powerful logic to deal with these assertions. ==='"UNIQ--h-18--QINU"'Peirce's logic of quantifiers=== As a way of affirming his intention to develop a theory in which ''logic becomes calculation'', Peirce defined quantifiers to emphasize their analogy with arithmetic operations:'"UNIQ--ref-00000091-QINU"' ::Here, in order to render the notation as iconical as possible, we may use $\sum$ for the quantifier '''Some''', suggesting a sum, and $\prod$ for the quantifier '''AII''', suggesting a product. Thus $\sum_i x_i$ means that $x$ is true of some one of the individuals denoted by $i$ or ::::$\sum_i x_i = x_i + x_j + x_k + \text{etc.}$ ::In the same way, ::::$\prod_i x_i = x_i x_j x_k \text{etc.}$ ::If $x$ is a simple relation, ::::$\prod_i \prod_j x_{i, j}$ means that every $i$ is in this relation to every $j$, ::::$\sum_i \prod_j x_{i, j}$ means that some one $i$ is in this relation to every $j$. Applying Peirce’s quantifiers as defined above to his logic of relations, we can then write as follows:'"UNIQ--ref-00000092-QINU"' ::for the relation $i$ $loves$ $j$ ::::$lover_{i,j}$ ::for the statement using this relation “Everybody $loves$ somebody” ::::$\prod_i \sum_j lover_{i,j}$ ==='"UNIQ--h-19--QINU"'Frege's predicate logic=== Frege well knew of the inadequacies of propositional logic. Further, he understood that the various constructions of the real numbers and the associated introduction of infinite sets into mathematics rested on two pillars:'"UNIQ--ref-00000093-QINU"' # the procedures of set theory # the assumptions of logic Having determined that set-theoretic procedures were somehow “founded in logic,” he sought to answer this question: What, then, were the basic notions of logic? As we have seen above, Boole developed his algebraic logic as a means by which ''deduction becomes calculation''. In 1879, Frege published his “axiomatic-deductive” logic, which stood Boole’s purpose on its head:'"UNIQ--ref-00000094-QINU"' * Frege’s goal: “to establish ... that arithmetic could be reduced to logic” and, thus, to create a logic by means of which ''calculation becomes deduction'' * Frege’s program: to develop arithmetic as an axiomatic system and show that all the axioms were truths of logic An essential point of Frege’s project has been summarized as an effort “to get beyond the ‘deductive’ reasoning of syllogisms [of classical logic] to all the ‘inductive’ rules [used in mathematical proofs, which] require writing down, not just true … statements about [specific] numbers (etc), but reasoning about collections of numbers together.” '"UNIQ--ref-00000095-QINU"' There is a further, perhaps more essential point to Frege’s project. Those working on the mid-19th-century arithmetization of analysis sought a precise manner of defining fundamental concepts of mathematics, such as limit, convergence, and continuity. In developing his logic, Dedekind sought a precise way of stating the results of his investigations into the nature of set and of numbers. Frege went further, however, seeking “a precise way not only of stating results, but also of proving them.” His insight was to realize “the difficulties of doing so using ordinary language, which was ... imprecise and ambiguous.”'"UNIQ--ref-00000096-QINU"' In 1879, Frege published a system of predicate logic that proved sufficient for the formalisation of mathematics. He achieved this by abandoning the Subject-Predicate analysis of sentences used in Aristotle’s syllogistic logic.'"UNIQ--ref-00000097-QINU"' The inspiration for Frege's predicate logic came from the mathematical concept of a function. He saw that the predicates in the statements of a syllogism could be expressed as concepts with variables that take arguments. The predicate “is Mortal” can be expressed as a concept that takes one argument, $\operatorname{Mortal}(x)$. The predicate “is a Teacher of” can be expressed as a concept that takes two arguments, $\operatorname{Teacher}(x, y)$. Viewed as such, predicates behave like functions in this sense:'"UNIQ--ref-00000098-QINU"' ::when specific values (names) replace the concept variables, the predicate is transformed into a statement that is true or false. Frege strongly urged the adoption of this functional interpretation of predicates:'"UNIQ--ref-00000099-QINU"' ::Logic has hitherto always followed ordinary language and grammar too closely…. I believe that the replacement of the … subject and predicate by argument and function, respectively, will stand the test of time. The greatest advance of Frege's logic over Aristotle's was its generality. It could handle all of the following:'"UNIQ--ref-0000009A-QINU"' ::* conjunctions, disjunctions, conditionals, and biconditionals of propositional logic ::* the logical equivalences involving negation described above ::* all combinations of quantifiers (All, Some, No, Not All) ::* relations, i.e., predicates involving two (or more) subjects In addition, Frege “drew attention to numerous important distinctions, e.g. between $x$ and $\{x\}$ and between $\in$ and $\subseteq$, which distinctions Dedekind failed somewhat to make in his theory of sets.'"UNIQ--ref-0000009B-QINU"' Using his logic, Frege defined with precision a formal deductive system, for which reason above all others he is nowadays commonly regarded as the founding father of modern logic.'"UNIQ--ref-0000009C-QINU"' Unfortunately, Frege symbolized statements using a far from intuitive 2-dimensional graphical method (Begriffsschrift -- 'concept-script' or 'ideography'). Here are his symbolizations for the four Aristotelian syllogistic sentence forms: '''A''', '''E''', '''I''', and '''O''':'"UNIQ--ref-0000009D-QINU"' ::{| class="wikitable" |- ! A: All a that are X are P !! E: All a that are X are not P !! I: Not all a that are X are not P !! O: Not all a that are X are P |- | [[File:Fregea1.jpg]] || [[File:Fregee1.jpg]] || [[File:Fregei1.jpg]] || [[File:Fregeo1.jpg]] |} It is thought that Frege’s cumbersome symbolism was what kept his logic from being adopted initially. Eventually, Frege’s logic was combined with Peano’s more intuitive notation, to create the predicate calculus used today. We will only mention briefly here what will be discussed farther on, namely, two essential elements of Frege’s logic that bear on his theory of arithmetic:'"UNIQ--ref-0000009E-QINU"''"UNIQ--ref-0000009F-QINU"' :1. ''concepts'' are the basic notions of logic, while ''sets'', which Frege defines as the extensions of predicates, are derivative notions: thus the set $\{x:P(x)\}$ is the extension of the predicate $P(x)$ :This view of sets is a broadening of Cantor’s early (restricted) view of naive sets, which were defined only for objects of a given mathematical domain. :2. for any logically definable predicate $P(x)$, we can form the set $\{a:P(a)\}$ :This ''naive comprehension principle'' has an analog stated implicitly in the Principles of Dedekind’s theory of sets. ==='"UNIQ--h-20--QINU"'A note on notation=== As set out above, somewhat contemporaneous with and quite independent of Frege’s invention of quantifiers for his axiomatic logic, C. S. Peirce invented quantifiers for Boole’s algebraic logic or, more precisely, for an algebra of relations that extended Boole’s logic. Frege disagreed with the assertion of Peirce that mathematics and logic are clearly distinct. To the contrary, as we have noted, Frege's view was that mathematics was reducible to logic or, more to the point, derivable from logic.'"UNIQ--ref-000000A0-QINU"''"UNIQ--ref-000000A1-QINU"' It is an irony that, though Frege invented his “logic of quantifiers” in order to support this view, his cumbersome 2-dimensional notation led to his invention being overlooked at the time. It was a linear notation somewhat similar to Pierce's that was adopted and that we use today. Here is an illuminating (and somewhat amusing) chronology of notational variants in the predicate calculus:'"UNIQ--ref-000000A2-QINU"' * In 1879, Frege developed his ''Begriffsschrift'' (concept writing), but for the next 30 years, his work was largely ignored. * In 1880, Peirce began to use the symbols $\prod$ and $\sum$, which he called quantifiers. * In 1885, Peirce added rules for quantifiers to Boolean algebra and published complete rules of inference for first-order logic. * In Germany (1890-95), Schröder adopted Peirce's notation, which became the standard for 20+ years. * In Italy, the logicians followed Peano, who had declared Frege's notation to be unreadable. * In England, Russell praised Frege’s logic, but adopted the Peirce-Peano notation, which came to be called Peano-Russell notation. The following table summarizes the symbolism of the Boole/Peirce algebra of logic:'"UNIQ--ref-000000A3-QINU"' ::{| class="wikitable" |- ! Operation !! Symbol !! Explanation |- | Disjunction || $+$ || Logical sum |- | Conjunction || $\times$ || Logical product |- | Negation || $-$ || $−1=0$ and $−0=1$ |- | Implication || $\prec$ || Equal or less than |- | Existential Quantifier || $\sum$ || Iterated sum |- | Universal Quantifier || $\prod$ || Iterated product |} The top three lines of the table are Boole’s. For his logical algebra, he used $1$ for truth and $0$ for falsehood, and he chose the symbols $+$, $\times$, and $−$ to represent ''disjunction'', ''conjunction'', and ''negation''. The bottom three lines of the table are Peirce's innovations:'"UNIQ--ref-000000A4-QINU"' * ''Implication'': Peirce observed that if $p \text{ implies } q$, then $q$ must always be true when $p$ is true, but $q$ might also be true for some reason independent of $p$. Therefore, the truth value of $p$ is ''always less than or equal to'' the truth value of $q$. Instead of using the symbol $≤$, which combines two operators, Peirce invented the claw symbol $\prec$ because it suggests a single, indivisible operation. * ''Existential quantifier'': In Boole's algebra, $1+1=1$. Therefore, Peirce adopted $\sum$ to indicate a logical summation of any number of terms, which would be true ''if at least one of the terms happened to be true''. * ''Universal quantifier'': In Boole's algebra, $1 \times 1 = 1$, so Peirce adopted $\prod$ to indicate a logical product of any number of terms, which would only be true ''if every one of the terms happened to be true''. It has been suggested that Peirce in algebraic logic and Frege in axiomatic logic did not so much invent the notion of quantifier, but rather separated and freed that notion from two tethers:'"UNIQ--ref-000000A5-QINU"' * from the notion of predicate in Aristotle’s syllogism, on the one hand * from the connectives in Boole’s algebra of logic, on the other After Frege and Peirce put the logic of predicates, variables and quantifiers into the language of logic, it became possible to apply this language to questions in the foundations of arithmetic, in particular, and of mathematics, generally .'"UNIQ--ref-000000A6-QINU"' =='"UNIQ--h-21--QINU"'Cantor’s general theory of sets== =='"UNIQ--h-22--QINU"'Axiomatic development of arithmetic== The modern theory of arithmetic was developed in the last decades of the nineteenth century. The people most closely associated with this development and the dates of their initial publications are as follows:'"UNIQ--ref-000000A7-QINU"' * Gottlob Frege (1884) * Richard Dedekind (1888) * Giuseppe Peano (1889) Though their published works have much in common, we judge from their statements that each completed his own work before becoming aware of the work of the others. ==='"UNIQ--h-23--QINU"'Grassmann's and Peirce's contributions=== A great deal of the work involved in axiomatizing arithmetic was done in the decades before Frege, Dedekind, and Peano published. As much as 90% of that work is said to have been done by one person, Hermann Grassmann. Certainly Peano knew of and acknowledged his use of Grassmann’s work, which was published in 1861 and included the following results:'"UNIQ--ref-000000A8-QINU"''"UNIQ--ref-000000A9-QINU"' * recursive definitions of addition and multiplication from one single argument operation, i.e. the successor operation $x+1$: ::$x+0=x$; $x+(y+1)=(x+y)+1$; ::$x \times 0=0$; $x \times (y+1)=(x \times y)+x$. * a definition of the induction principle, stated as follows in modern terminology: ::Let variables $x, y, …$ range over natural numbers, and let :::$0$ denote the number "zero" :::$Sx$ denote the operation $x+1$ :::$F$ range over sets of natural numbers. ::$0 \in F \wedge \forall x(x \in F \Rightarrow Sx \in F)) \Rightarrow \forall x(x \in F)$ * a demonstration that the commutative law can be derived from the associative law by means of this induction principle. In 1881, Peirce published a set of axioms of number theory. His purpose was to use his quantified logic of relations to construct the system of natural numbers based on definitions and axioms. In his own words, he published his axioms for natural numbers to establish that “elementary propositions concerning number ... are strictly syllogistic consequences from a few primary propositions.”'"UNIQ--ref-000000AA-QINU"' Starting from his definition of ''finite set'', Peirce’s axioms are (in modern terminology) as follows:'"UNIQ--ref-000000AB-QINU"' ::Given the following: ::* a set $N$ ::* $R$, a relation on $N$ ::* $1$, an element of $N$ ::* definitions of minimum, maximum, and predecessor with respect to $R$ and $N$ ::Peirce’s axioms: # $N$ is partially ordered by $R$. # $N$ is connected by $R$. # $N$ is closed with respect to predecessors. # $1$ is the minimum element of $N$; $N$ has no maximum. # Mathematical induction holds for $N$. Pierce’s axioms for the natural numbers start from finite sets, but they are nonetheless equivalent both to the defining conditions stated by Dedekind and to the axioms developed by Peano.'"UNIQ--ref-000000AC-QINU"' ==='"UNIQ--h-24--QINU"'Frege's theory of arithmetic=== Frege, by virtue of his work creating predicate logic, is one of the founders of modern (mathematical) logic. His view was that mathematics is reducible to logic. His major works published with the goal of doing this are these:'"UNIQ--ref-000000AD-QINU"' * in 1879 -- ''Begriffsschrift'', defining his “axiomatic-deductive” predicate calculus for the ultimate purpose of proving the basic truths of arithmetic "by means of pure logic." * in 1884 -- ''Die Grundlagen der Arithmetik'', using his predicate calculus to present an axiomatic theory of arithmetic. * in 1893/1903 -- ''Die Grundgesetze der Arithmetik'', presenting formal proofs of number theory from an intuitive collection of axioms. As we have seen, Boole’s developed his algebra of logic as a means by which ''deduction becomes calculation''. Frege's predicate calculus in the ''Begriffsschrift'' stood Boole’s purpose on its head:'"UNIQ--ref-000000AE-QINU"' * Frege’s goal: “to establish ... that arithmetic could be reduced to logic” and, thus, to create a logic by means of which ''calculation becomes deduction'' * Frege’s program: to develop arithmetic as an axiomatic system such that all the axioms were truths of logic Driven by “an over-ruling passion to demonstrate his position conclusively” and not “content with the usual informal mathematical standard of rigour,” Frege’s exposition in ''Grundgesetze'' is characterized by a great degree by precision and explicitness.'"UNIQ--ref-000000AF-QINU"' He himself tells us why this is so:'"UNIQ--ref-000000B0-QINU"' ::[T]he fundamental propositions of arithmetic should be proved…with the utmost rigour; for only if every gap in the chain of deductions is eliminated with the greatest care can we say with certainty upon what primitive truths the proof depend. Frege gave the following reason for developing his logic as an axiomatic system:'"UNIQ--ref-000000B1-QINU"' ::Because we cannot enumerate all of the boundless number of laws that can be established, we can obtain ''completeness'' only by a search for those [laws] which, potentially, imply all the others. Frege also commented on the role of proof in mathematics:'"UNIQ--ref-000000B2-QINU"' ::The aim of proof is not merely to place the truth of a proposition beyond all doubt, but also to afford us insight into the ''dependence'' of truths upon one another. Frege identified as the ''kernel'' of his system the axioms (laws) of his logic that potentially imply all the other laws. His statements above imply that he thought his system to be complete and his axioms to be independent. He did not, however, provide precise definitions of completeness and independence nor did he attempt a proof that his system was complete and his axioms independent. Early in his first book on the foundations of arithmetic, Frege established his purpose:'"UNIQ--ref-000000B3-QINU"' ::[I]t is above all $Number$ which has to be ''either defined or recognized as indefinable''. This is the point which the present work is meant to settle. Frege began the introduction of numbers into his logic by defining what is meant by saying that two $Numbers$ are equal:'"UNIQ--ref-000000B4-QINU"''"UNIQ--ref-000000B5-QINU"' ::two concepts $F$ and $G$ are equal if the things that fall under them can be put into one-one correspondence From this he arrives at the notion that “a $Number$ is a set of concepts”: * §72 the $Number$ that belongs to the concept $F$ is the extension of the concept “equal to the concept $F$” :and then continues as follows by defining the expression ::::$n$ is a $Number$ :to mean ::::there exists a concept such that $n$ is the $Number$ that belongs to it. * §73 he draws this inference ::::the concept $F$ is equal to the concept $G$ :implies ::::the $Number$ belonging to the concept $F$ is identical to the $Number$ belonging to the concept $G$ * §74 he defines the $Number$ $0$ as ::::the $Number$ that belongs to the concept “not identical with itself” * §75 he immediately clarifies this, stating ::::Every concept under which no object falls is equal to every other concept under which no object falls, and to them alone. :and therefore ::::$0$ is the $Number$ which belongs to any such concept, and no object falls under any concept if the number which belongs to that concept is $0$. * §76 he defines the $Successor$ relation ::::$n$ follows in the series of $Numbers$ directly after $m$ :to mean ::::there exists a concept $F$ and an object falling under it, $x$, such that ::::::the $Number$ belonging to the concept $F$ is $n$ ::::and ::::::the $Number$ belonging to the concept “falling under $F$ but not equal to $x$” is $m$ * §77 he defines the $Number$ $1$ as ::::“the $Number$ belonging to the concept ‘identical with $0$’” :from which it follows that ::::$1$ is the $Number$ that follows directly after $0$ * §78-81 he proves or gives a proof sketch for several propositions regarding the $Successor$ relation, using definitions of $series$ and $following$ $in$ $a$ $series$ from his earlier work of 1879 ::* the $Successor$ relation is 1-1 ::* every $Number$ except $0$ is a $Successor$ ::* every $Number$ has a $Successor$ * §82 he outlines a proof that there is no last member in the series of $Numbers$ * §83 he provides a definition of finite Number, noting that no finite Number follows in the series of natural numbers after itself * §84 he notes that the $Number$ which belongs to the concept 'finite N$umber$' is an infinite $Number$. Central to all of this work was a distinction that Frege was developing, but only finally published in 1892 and incorporated in the ''Grundgesetze'', namely, that every concept, mathematical or otherwise, had two important, entirely distinct aspects:'"UNIQ--ref-000000B6-QINU"''"UNIQ--ref-000000B7-QINU"' # ''Sinn'': a “meaning” or “sense” or “connotation” # ''Bedeutung'': an “extension” or “reference” or “denotation” This distinction of Frege's is the basis of what Gödel (many years later) characterized as the ''dichotomic conception'':'"UNIQ--ref-000000B8-QINU"' ::Any well-defined concept (property or predicate) $P(x)$ establishes a dichotomy of all things into those that are $P$s and those that are non-$P$s. :In other words, ::a concept partitions $V$ (the universe of discourse) into two classes: the class $\{ x : P(x) \}$ and its absolute complement, the class $\{ x : \neg P(x) \}$. Underlying this notion are two key assumptions: # the existence of a ''Universal Set'', $V$ -- what we have seen as Dedekind’s ''Gedankenwelt'' # the unrestricted principle of ''Comprehension'' -- ''any'' well-defined property determines, a set. For “naïve” set theory, these two assumptions are equivalent and either one of them suffices to derive the other: * to derive ''Universal Set'' from ''Comprehension'': ::::replace $Φ(x)$ by a truism, such as the property $x = x$. * to derive ''Comprehension'' from the ''Universal Set'': ::assume an all-encompassing set $V$, ::::note that any part of $V$ is also a set, ::::and that any well-defined concept $P(x)$ defines a subset of $V$, ::therefore the set $\{ x : P(x) \}$ exists! To these two assumptions, add Dedekind's principle of ''Extensionality''. Frege intended the ''Grundgesetze'' to be the implementation of his program to demonstrate “every proposition of arithmetic” to be ”a [derivative] law of logic.” In this work of 19 years duration, there was no explicit appeal to an ''unrestricted'' principle of Comprehension. Instead, Frege's theory of arithmetic appealed to Comprehension by virtue of its symbolism, according to which for any predicate $Φ(x)$ (concept or property) one can form an expression $S = \{ x : Φ(x)\}$ defining a set. Frege's theory assumes that (somehow) there is a mapping which associates an object (a set of objects) to every concept, but he does not present comprehension as an explicit assumption. All of this is in contrast to the use of ''restricted'' predicates in Cantor's early theory of sets.'"UNIQ--ref-000000B9-QINU"''"UNIQ--ref-000000BA-QINU"' ==='"UNIQ--h-25--QINU"'Dedekind’s theory of numbers=== ==='"UNIQ--h-26--QINU"'Peano’s axioms of arithmetic=== From 1891 until 1906, Peano and his colleagues published substantial amounts of formalized mathematics in his journal ''Rivista di Matematica''. Their objective was not to reduce mathematics to a logical foundation, but to rewrite mathematics “in a formal framework,” that is, to use a formal notation as an aid to precision. Peano’s substantial interest in stating mathematical results and arguments precisely rose out of his teaching experience. '"UNIQ--ref-000000BB-QINU"' Peano knew of and studied the work of both Grassmann and Frege “before he began his ''Arithmetices principia''. Along with them, he believed that ordinary language -- and therefore any mathematics that was explained in it -- was too ambiguous. Peano’s goals were these:'"UNIQ--ref-000000BC-QINU"' # to set up a solid system of arithmetic # to improve logic symbols and notation # to establish axioms that would serve as the basis for all arithmetic Like Dedekind, Peano accepted “class” as a logical notion, but, unlike Frege, Peano did not think that number could be defined in terms of logical notions.'"UNIQ--ref-000000BD-QINU"' In 1889, Peano published his first system of axioms for the natural numbers, in which he defined “every sign ... except ... four”:'"UNIQ--ref-000000BE-QINU"''"UNIQ--ref-000000BF-QINU"' # ’’number’’ (positive integer) # ’’unity’’ # ’’successor’’ # ’’equality’’ (of numbers) Peano wrote his axioms, definitions, and proofs using the symbols that he defined in the preface to booklet. He intended the structure so created to be sufficient to derive “every result in arithmetic.”'"UNIQ--ref-000000C0-QINU"' In 1891, Peano published a 2nd, simplified system of axioms, using only three undefined terms: $\mathbb{N}$ ($number$), $1$ ($One$), and $a^+$ (the $successor$ of $a$, where $a$ is a $number$).'"UNIQ--ref-000000C1-QINU"' These may be stated informally as follows: # $One$ is a $number$ # The sign $^+$ placed after a $number$ $a$ produces a $number$ $a^+$ # If $a$ and $b$ are two $numbers$, and if their $successors$ are equal, then they are also equal # $One$ is not the $successor$ of any $number$ # If $s$ is a class containing $One$, and if the class made up of the $successors$ of $s$ is contained in $s$, then every $number$ is contained in the class $s$. In 1898, Peano published a third system of axioms in which the undefined term $0$ ($Zero$) replaced the term $1$ (one). It is this system of axioms that is commonly known today as [[Peano axioms]] and that can be stated informally as follows:'"UNIQ--ref-000000C2-QINU"' # $Zero$ is a $number$ # The $successor$ of any $number$ is another $number$ # There are no two $numbers$ with the same $successor$ # $Zero$ is not the $successor$ of a $number$ # Every property of $Zero$, which belongs to the $successor$ of every $number$ with this property, belongs to all $numbers$ Note particularly the language of induction axiom 5, in which talk of classes is replaced by talk of properties. This change stems from Frege’s notion (discussed above) about the relationship between the ’’extension’’ and the ’’meaning’’ of a concept. ::The extension of a mathematical predicate (property, concept) $P(x)$ is just $\{x:P(x)\}$, the collection of everything for which the predicate is true. In a note immediately following his 1898 statement of the axioms, Peano noted this:'"UNIQ--ref-000000C3-QINU"' ::These primitive propositions . . . suffice to deduce all the properties of the numbers that we shall meet in the sequel. There is, however, an infinity of systems which satisfy the five primitive propositions. . . . All systems which satisfy the five primitive propositions are in one-to-one correspondence with the natural numbers. The natural numbers are what one obtains by abstraction from all these systems; in other words, the natural numbers are the system which has all the properties and only those properties listed in the five primitive propositions. ([14], p. 218). Finally, in 1901, Peano added another axiom, which he numbered axiom 0, to the five axioms noted above.'"UNIQ--ref-000000C4-QINU"' :0. The (natural) $numbers$ form a class Various and diverse modern formalizations of Peano’s axioms exist. Typical differences among them involve the following:'"UNIQ--ref-000000C5-QINU"' * alternate orders of stating the axioms, especially with the axiom of induction stated last * alternate formulations of the axiom of induction itself, for example: ::::* $\forall S \in Sets : (0 \in S \wedge \forall n : n \in S \to n’ \in S) \to \mathbb{N} \subset S$ ::::* $\forall P \in Predicates : (P(0) \wedge \forall n : P(n) \to P(n’)) \to \forall n : P(n)$ All of Peano’s formulations of the induction axiom (and of those stated above) are second-order statements. Peano did not discuss the consistency of his axioms. He did, however, examine the independence of his axioms, that is, whether or not all of his axioms are actually needed, by defining, for each axiom, a set for which the axiom being considered was false, but for which the other axioms remained true, as follows:'"UNIQ--ref-000000C6-QINU"''"UNIQ--ref-000000C7-QINU"' An alternate way of demonstrating the independence of axioms is as follows:'"UNIQ--ref-000000C8-QINU"' ::To prove that every axiom is needed to define the natural numbers, we need to remove each one from the set of axioms and demonstrate that the remaining axiom set has models that are not isomorphic to the natural numbers. ==='"UNIQ--h-27--QINU"'Another note on notation=== Peano, who wanted used logic to derive mathematics, needed logical symbols that could be freely mixed with mathematical symbols in formulas. He therefore replaced Peirce's logical symbols with new ones, occasionally turning letters upside down and/or backwards to form them. The following table lists Peirce's symbols and Peano's replacements:'"UNIQ--ref-000000C9-QINU"' ::{| class="wikitable" |- ! Operation !! Peirce !! Explanation !! Peano !! Explanation |- | Disjunction || $+$ || Logical sum || $\lor$ || v for ’’vel’’ |- | Conjunction || $\times$ || Logical product || $\land$ || Upside down v |- | Negation || $-$ || $−1=0$ and $−0=1$ || $\sim$ || Curly minus sign |- | Implication || $\prec$ || Equal or less than || $\supset$ || C for ''consequentia'' |- | Existential Quantifier || $\sum$ || Iterated sum || $\exists$ || E for ''existere'' |- | Universal Quantifier || $\prod$ || Iterated product || $( )$ || O for ''omnis'' |} ==='"UNIQ--h-28--QINU"'Whose axioms are they -- anyway?=== A terminological dispute has arisen over the use of “Peano axioms” to designate the axioms of arithmetic. This designation has been called into question by some since, in developing his axioms, Peano himself acknowledged the following:'"UNIQ--ref-000000CA-QINU"' * he made extensive use of Grassmann's work * he “borrowed” the axioms themselves from Dedekind Indeed, as Peano himself stated it:'"UNIQ--ref-000000CB-QINU"' ::... I used the book of H. Grassmann … and the recent work by R. Dedekind…. Certainly, as we have seen above, in 1888, one year before Peano’s work, Dedekind did publish a similar system of axioms and obtained similar results. As a result, some have argued that Dedekind deserves at least as much (if not more) credit than Peano for the postulates on the natural numbers, referring to them as Dedekind-Peano axioms:'"UNIQ--ref-000000CC-QINU"' ::What it means to be “simply infinite” is captured in four ‘Dedekindian’ conditions, which are “a notational variant of Peano's axioms for the natural numbers” and, hence, “are thus properly called the Dedekind-Peano axioms.” As to whether Peano knew of and, therefore, may have borrowed something from Dedekind work, there are conflicting claims: * one source claims that Peano was completely unaware of Dedekind’s book ''until after his own was published''.'"UNIQ--ref-000000CD-QINU"' * a more nuanced claim is that Peano read Dedekind’s essay only ''as his own book was going to press'' and stated in his own preface that he had found Dedekind’s essay “useful”… meaning (perhaps) that he found confirmation of “the independence of the primitive propositions from which I started.”'"UNIQ--ref-000000CE-QINU"' The argument has been made that the “much more clear and more thorough” nature of Peano’s work is reason enough for remembering him as the “creator” of the axioms, with the following suggested as deficiencies in Dedekind’s work:'"UNIQ--ref-000000CF-QINU"' ::* Dedekind only writes three axioms, equivalent to Peano’s 1889 axioms 1, 7, and 9 ::* he omits any discussion of the equality relation ::* he does not explicitly define the successor function in an axiom In the same regard, Dedekind’s notation for the successor of a number $a$ as $a’$ is less preferred than Peano’s notation of $a +1$, which makes the definition more obvious.'"UNIQ--ref-000000D0-QINU"' Finally, support for nominating the axioms as Peano’s rather than Dedekind’s has been based on the differences in their purposes: ::”Peano’s primary interest was in axiomatics”: he neither developed nor used his logic for the purpose of “reducing” mathematical concepts to logical concepts and, indeed, “he denied the validity of such a reduction.”'"UNIQ--ref-000000D1-QINU"' ::it is correct to call the axioms Peano’s rather than Dedekind’s, because Peano was not trying to define the primitive notions of arithmetic, but rather to characterize them axiomatically; whereas Dedekind was not trying to axiomatize arithmetic, but rather to define arithmetical notions in terms of logical ones.'"UNIQ--ref-000000D2-QINU"' This last point may be the most telling, suggesting as it does that Dedekind himself would not have wanted his ‘Dedekindian’ conditions to be called axioms. =='"UNIQ--h-29--QINU"'Axiomatic development of geometry== ==='"UNIQ--h-30--QINU"'Early efforts=== . . . . . ==='"UNIQ--h-31--QINU"'Hilbert's ''Grundlagen''=== Hilbert understood that the arithmetization of analysis and the axiomatization of arithmetic were notable achievements of nineteenth century mathematics. Through them, most of mathematics had been provided with a strict axiomatic foundation. What he objected to was any suggestion that the concepts of arithmetic alone were susceptible of a fully rigorous treatment. He felt that another, equally notable achievement of the nineteenth century was the flourishing of geometry and, in particular, the development of non-Euclidean geometries. What remained, then, was to establish a purely formal and deductive basis for geometry.'"UNIQ--ref-000000D3-QINU"' Euclid’s ''Elements'' was based on 5 axioms and 5 postulates and had a logical structure that enabled the development of proofs. However, it also had serious deficiencies, consisting of concealed assumptions, meaningless definitions, and logical inadequacies.'"UNIQ--ref-000000D4-QINU"''"UNIQ--ref-000000D5-QINU"' * Gauss, for example, had pointed out that the notion of ''betweenness'' was often used in Euclid, but was never defined. * More generally, the discovery of non-Euclidean geometries had, in itself, stimulated a general determination among mathematicians to bring out unstated assumptions and either justify them or avoid them Hilbert himself did the pioneer work towards the end of giving geometry the purely formal character found in algebra and analysis. In 1899, the year before his Paris Problems Address, he published his theory of geometry, ''Grundlagen der Geometrie'', based on the following:'"UNIQ--ref-000000D6-QINU"' * undefined objects (elements): $point$, $line$, and $plane$ * undefined notions (concepts) including these: being on/in, being between, being congruent, being parallel, & being continuous * assumptions (axioms) in these five groups: incidence, order, congruency, parallelism, continuity. As Hilbert intended, the axioms were arranged in five groups, each of which defined a concept (''incidence'', ''order'' or ''betweenness'', ''congruence'', ''parallelism'', and ''continuity'') and expressed “certain related fundamental facts of our [spatial] intuition.”'"UNIQ--ref-000000D7-QINU"''"UNIQ--ref-000000D8-QINU"''"UNIQ--ref-000000D9-QINU"' In developing his theory of geometry, Hilbert discarded the “intuitive-empirical” level of the older geometrical views, made all his assumptions explicit, analyzed the interdependence of his axioms, and gave his undefined terms no properties beyond those indicated in the axioms:'"UNIQ--ref-000000DA-QINU"' * points, lines, and planes were to be understood as elements of certain given sets * undefined relations were to be treated as abstract correspondences or mappings In this regard, and as Hilbert put it in a letter to Frege, “every theory is only an abstract structure or schema of concepts together with their necessary relations to one another, [while] the basic elements can be thought of in any way one likes.”'"UNIQ--ref-000000DB-QINU"' The following anecdote speaks to the earnestness of Hilbert’s intentions with respect to leaving his notions undefined:'"UNIQ--ref-000000DC-QINU"' ::In 1891, Hilbert attended a lecture on the foundations of geometry given at the Deutsche Mathematiker-Vereinigung meeting in Halle. Decades later (in 1935) it was reported that Hilbert came out of that meeting greatly excited by what he had just heard and made his famous declaration: “it must be possible to replace 'point, line, and plane' with 'table, chair, and beer mug' without thereby changing the validity of the theorems of geometry.” Hilbert described the specific aim of Grundlagen as an attempt to lay down a “simple” and “complete” system of “mutually independent” axioms, from which all known theorems of (Euclidean) geometry might be deduced. His larger overall purpose was to provide a foundation both different from the evidence of intuition and sufficient not only for Euclid’s geometry, but (eventually) also for the various non-Euclidean geometries.'"UNIQ--ref-000000DD-QINU"' As the “sufficiently general and comprehensive principle” necessary for his purpose, Hilbert chose the axiomatic method.'"UNIQ--ref-000000DE-QINU"' Even if intuition was not to serve as the foundation for geometry, Hilbert nevertheless understood that the process of axiomatization started began with intuitions of a domain of facts [Tatsachen]. In summary, Hilbert’s description of the way the axiomatic method proceeds is as follows:'"UNIQ--ref-000000DF-QINU"' # it analyzes the theorems and concepts of a mathematical theory # it isolates the basic principles that correspond to intuitive ideas # it formalizes these principles as axioms. Again decades later, he would describe the process of axiomatization as follows:'"UNIQ--ref-000000E0-QINU"' ::The method of the axiomatic construction of a theory [is a] mapping [Abbildung] of a domain of knowledge onto a framework of concepts, which is carried out in such a way that to the object of the domain of knowledge there now correspond the concepts, and to statements about the objects there correspond the logical relations between the concepts. In his early (thru 1905) writings, Hilbert considered axiomatic systems to be ''open'' systems:'"UNIQ--ref-000000E1-QINU"' ::If geometry is to serve as a model for the treatment of physical axioms, we shall try first by a small number of axioms to include as large a class as possible of physical phenomena, and then by adjoining new axioms to arrive gradually at the more special theories. Hilbert elaborated this in stating what he considered to be “the principal task of non-Euclidean geometry”:'"UNIQ--ref-000000E2-QINU"' ::constructing the various ''possible'' geometries by the successive introduction of elementary axioms, up until the ''final construction of the only remaining one'', Euclidean geometry. This process of successively introducing axioms has been used in at least one presentation of Hilbert’s axiom system for plane geometry, whose author described the process as follows:'"UNIQ--ref-000000E3-QINU"' ::As we introduce Hilbert’s axioms, we will gradually put more and more restrictions on these [basic] ingredients [points and lines in a plane] and in the end they will essentially determine Euclidean plane geometry uniquely. The initial choice of a system of axioms was not, then, the end of an enquiry into the foundations of a theory. Rather, the enquiry would not be complete until the axioms, which define the concepts and relations of a theory, are such that ''no other characteristics of those concepts and relations can be added''.'"UNIQ--ref-000000E4-QINU"' Enquiry into foundations is thus an evolution in the direction of an ever better understanding of the basic concepts and relations of a theory, for which the axioms provide definitions. Hence, further experience working with a theory can lead to a widening of those definitions and, consequently, a widening of our understanding of those basic concepts and of the entire theory itself.'"UNIQ--ref-000000E5-QINU"' The sense in which axioms are ''implicit definitions'' is made apparent by considering that if the terms of a theory (the theory of geometry, for example) support multiple interpretations, then the sentences of that theory, and sets of those sentences, provide definitions ''of a certain kind'':'"UNIQ--ref-000000E6-QINU"' ::A set $AX$ of sentences containing $n$ (geometric) terms defines an $n-place$ relation $R_{AX}$ holding of just those $n-tuples$ which, when taken respectively as the interpretations of $AX$'s (geometric) terms, render the members of $AX$ true. Thus the terms $n$ of $AX$ serve as "place-holders" that are devoid of meaning in themselves, but that yield to multiple interpretations. In ''Grundlagen'', Hilbert demonstrated the following:'"UNIQ--ref-000000E7-QINU"' * the consistency of various sub-groups of the axioms * the independence of a number of axioms from others * various relations of provability * independence of important theorems from specific groups of the axioms * the consistency of the entire set of axioms for Euclidean geometry * the independence of the axiom of parallels from the other Euclidean axioms Hilbert’s demonstrations of the consistency and the independence of his axioms were demonstrations he made relative to a familiar, background theory whose consistency was accepted. More specifically, he proved that the consistency of geometry could be reduced to proving the consistency of arithmetic. The method he used to do this was as follows:'"UNIQ--ref-000000E8-QINU"''"UNIQ--ref-000000E9-QINU"' * ''Consistency'': Given a set $AX$ of sentences (described as above) and a familiar, background theory $B$, which is assumed to be consistent, construct an interpretation of the $n$ terms of $AX$ under which the members of $AX$ express theorems of $B$. This interpretation is an $n-tuple$ satisfying the relation $R_{AX}$ defined by $AX$. Its existence demonstrates the satisfiability of $R_{AX}$ and consequently the consistency of $AX$, relative to that of $B$. * ''Independence'': Given set $AX$ of sentences, another statement $I$, and a familiar, background theory $B$, which is assumed to be consistent, construct an interpretation of $AX$'s and $I$’s terms under which the members of $AX$ express theorems of $B$, while $I$ expresses the negation of a theorem of $B$. Proceeding as above, the consistency of $AX \cup \{~I\}$ relative to that of $B$ demonstrates the independence of $I$ from $AX$, relative to that of $B$. As Hilbert understood it, consistency applied to the abstract structure of concepts and relations that were defined by $AX$ when its (geometric) terms were taken as place-holders. The consistency that he had in mind held of $AX_\mathbb{G}$ $\iff$ it held of $AX_\mathbb{R}$, since both shared (were instances of) the same abstract structure. '"UNIQ--ref-000000EA-QINU"' Equivalently, if there is an interpretation under which the sentences of $AX_\mathbb{G}$ expressed truths of $AX_\mathbb{R}$, then the question of the consistency for $AX_\mathbb{G}$ relative to $AX_\mathbb{R}$ was answered in the affirmative. In the context of formal theories, Hilbert’s conception of consistency and his associated methodology for consistency-proofs are, for the most part standard today.[236]

The rigor required for the axiomatic analysis underlying Grundlagen made necessary many additions, corrections, and improvements over the years following the books first edition. Most of these changes concerned only details. The basic structure of Grundlagen (the groups of axioms, the theorems considered, and the innovative methodological approach) remained unchanged through many editions.[237]

The ideas and methods that Hilbert put to work in his early efforts at axiomatization not only made possible at the time a foundation for geometry and the theory of real numbers, but also are still at work today shaping contemporary mathematical practice.[238]

. . . . .

## Hilbert’s 2nd problem

In his 1990 lecture to the International Congress of Mathematicians in Paris, David Hilbert presented a list of open problems in mathematics. He expressed the 2nd of these problems, known variously as the compatibility of the arithmetical axioms and the consistency of arithmetic, as follows:[239]

When we are engaged in investigating the foundations of a science, we must set up a system of axioms which contains an exact and complete description of the relations subsisting between the elementary ideas of that science. The axioms so set up are at the same time the definitions of those elementary ideas; and no statement within the realm of the science whose foundation we are testing is held to be correct unless it can be derived from those axioms by means of a finite number of logical steps. Upon closer consideration the question arises: Whether, in any way, certain statements of single axioms depend upon one another, and whether the axioms may not therefore contain certain parts in common, which must be isolated if one wishes to arrive at a system of axioms that shall be altogether independent of one another.
But above all I wish to designate the following as the most important among the numerous questions which can be asked with regard to the axioms: To prove that they are not contradictory, that is, that a definite number of logical steps based upon them can never lead to contradictory results.

Hilbert’s 2nd problem arose from a principle that had only recently emerged in his thought, namely, that “mathematical existence is nothing other than consistency.”[240]

In the decades that followed his lecture, Hilbert made this 2nd problem more explicit by developing “a formal system of explicit assumptions” (see Axiom and Axiomatic method) upon which he intended to base the methods of mathematical reasoning. He then stipulated that any such system must be shown to have these characteristics:[241][242]

1. the assumptions should be "independent" of one another (see Independence)
2. the assumptions should be “consistent” (free of contradictions) (see Consistency)
3. the assumptions should be “complete” (represents all the truths of mathematics) (see Completeness)
4. there should be a procedure for deciding whether any statement expressed using the system is true or not (see Decision problem and Undecidability)

Hilbert's 2nd problem is said by some to have been solved, albeit in a negative sense, by K. Gödel (see Hilbert problems and Gödel incompleteness theorem).

## Notes

1. Dedekind (1888) p. 35 cited in Gillies p. 8
2. Dasgupta p. 29
3. Jones (1996)
4. Ewald (2002) p. 2
5. Ewald (2002) p. 2
6. Compare this section with a related discussion of non-mathematical issues in the Arithmetization of analysis program.
7. Renfro
8. Waterhouse p. 435 cited in Renfro
9. O’Connor and Robertson (2005)
10. Grattan-Guinness p. 125 footnote cited in Renfro
11. Boyer pp. 270-271 cited in Renfro
12. Wikipedia “C S Peirce” § “Mathematics” emphasis added. Readers are encouraged to review the Mathematics section of this Wikipedia article for its notes and references for these and others of Peirce’s discoveries.
13. O’Connor and Robertson (2002) “Frege”
14. Gillies p. 78
15. Reck (2013)
16. Russell cited in O’Connor and Robertson (2002) “Frege”
17. O’Connor and Robertson
18. Encyclopedia Britannica “Augustus De Morgan”
19. Hodges (2015)
20. Reck (2013) Abstract
21. Ewald (2002)
22. For related modern mathematical notions, see Abstraction, mathematical, Abstraction of actual infinity, Abstraction of potential realizability, and Infinity
23. Netz
24. Netz
25. Spalt cited in O'Connor and Robertson (2002)
26. Netz, Saito, and Tchernetska cited in O'Connor and Robertson (2002)
27. Kirschner 2.6 Mathematics
28. O'Connor and Robertson, (2002)
29. O'Connor and Robertson, (2002). The property that an infinite set can be put into one-to-one correspondence with a proper subset of itself is today known as the Hilbert infinite hotel property.
30. Waterhouse cited in O’Connor and Robertson (2002)
31. Netz
32. Bolzano cited in O’Connor and Robertson (1996) (2002) (2005)
33. Dedekind (1930/32) Vol. 1, pp. 46-47, quoted in Kanamori (2012) p. 49, cited in Reck (2013) slide 5
34. Ferreirós (2011b) §1
35. Gillies p. 8 emphasis added
36. Ferreirós (2011b) §1
37. Reck (2011) §2.2
38. Gillies p. 8
39. Bochenski cited in Boyer p. 633
40. See the Historical sketch in Mathematical logic
41. Moore p. 96
42. Ferreirós (2001) p. 442
43. Jones “The History of Formal Logic”
44. Jones “A Short History of Rigour in Mathematics”
45. Ferreirós (2001) p. 441
46. Boyer p. 633
47. van Benthem et. al. (2014). The expository material on Aristotelian syllogisms is excerpted from Chapter 3 of the text.
48. Boyer pp. 633-634 emphasis added
49. Peacock cited in O’Connor and Robertson (2015)
50. Peacock cited in O’Connor and Robertson (2015) emphasis added
51. Boyer pp. 633-634 emphasis added
52. O’Connor and Robertson “Augustus De Morgan”
53. Boyer p. 623
54. De Morgan (1849) cited in Barnett p. 3
55. De Morgan (1847) cited in Barnett p. 1
56. Barnett p. 1
57. Boyer p. 633
58. Gillies pp. 74-75
59. Boyer pp. 633-634
60. O’Connor and Robertson (2004)
61. See Boolean algebra.
62. Moore p. 96
63. Burris (2014) §4.
64. Burris (2014) §3.
65. Burris (2014). Burris provides a detailed, step-by-step description of the process that Boole used to analyze arguments using his algebraic logic.
66. Boyer p.635
67. Burris (2014) provides a selection of examples illustrating the workings of his methods, including “a substantial example” of the workings of Boole’s General Method found in his 1854 work.
68. O’Connor and Robertson (2004) emphasis added
69. van Benthem 2. The shift from classical to modern logic
70. Gillies p. 73
71. Burris (2015) §4. Jevons...
72. Grattan-Guinness (1991) cited in O’Connor and Robertson (2000)
73. Boyer p. 636. See De Morgan laws for a modern formal statement of these laws. See Duality principle for a general discussion of mutual substitution of logical operations in the formulas of formal logical and logical-objective languages.
74. Boyer pp. 636-638
75. Encyclopædia Britannica “History of Logic § C S Peirce” emphasis added
76. Tarski p. 73
77. Anellis (2012b) § 2
78. Peirce cited in Anellis (2012b) § 2
79. Anellis (2012a) p. 246
80. Anellis (2012a) pp. 252-253
81. Tarski pp. 73-74
82. Set theory
83. Wikipedia “Naive set theory”
84. Porubsky notes that the term naive set theory came into broad use in the 1960s following its use as the title of Halmos’ text.
85. Bolzano cited in Porubsky
86. Bolzano §4 cited in Tait p. 2
87. Porubsky
88. Tait p. 2
89. Bolzano §3 cited in Tait p. 3. Tait tempers this criticism of Bolzano’s understanding, noting that both Cantor and Dedekind also avoided the null set -- “no whole has zero parts” -- and that “as late as 1930, Zermelo chose in his important paper [1930] on the foundations of set theory to axiomatize set theory without the null set.”
90. Bolzano §11 cited in Tait p. 3
91. Brown (2010) §"Naive Set vs. Axiomatic Set Theories"
92. Wikipedia “Naive set theory”
93. O’Connor and Robertson “A history of set theory”
94. Bagaria §1
95. Ebbinghaus p. 298 cited in Porubsky
96. Tait p. 3
97. Wikipedia “Naive set theory”
98. O’Connor and Robertson “A history of set theory”
99. Ebbinghaus p. 298 cited in Porubsky
100. Bagaria (2014) §1
101. Ferreirós (2011b) §1
102. Ferreirós (2011b) §1 citing Ewald (1996) Vol. 2
103. Burris (1997)
104. O’Connor and Robertson “A history of set theory”
105. El Naschie (2015)
106. O’Connor and Robertson “A history of set theory”
107. Burris (1997)
108. Tait p. 2
109. El Naschie, M S. (2015)
110. Burris (1997)
111. El Naschie, M S. (2015)
112. Bagaria (2014)
113. Tait p. 5-6
114. Tait pp. 5-6
115. Tait p. 4
116. Wikipedia "Set theory"
117. Halmos cited in Toida (2013) §"Naive Set Theory vs. Axiomatic Set Theory"
118. Toida (2013) §"Naive Set Theory vs. Axiomatic Set Theory"
119. Tait p. 2
120. Tait p. 3
121. Tait p. 2
122. Porubsky
123. Azzano p. 8
124. Gillies (1982) p. 8
125. Reck (2012) §2.2
126. Azzano p. 12
127. Reck (2012) 2.1
128. Reck (2012) §2.3
129. Reck (2012) §2.2
130. Azzano p. 10
131. Reck (2012) §2.3
132. Azzano p. 12
133. Gillies p. 51
134. Frege (1893) cited in Gillies p. 51
135. Gillies p. 52
136. Gillies p. 51
137. Gillies p. 66
138. Ferreirós (2011a) p. 6
139. Dedekind (1888) cited in Gillies pp. 52-58
140. Gillies pp. 52-53.
141. Gillies notes that these two notions, basic to set theory, were not completely distinguished, both notationally and conceptually, until Peano did so in 1894.
142. Gillies speculates that Dedekind’s “certain reasons” for excluding the empty set arise from difficulties caused by his conflating $a \in S$ and $A \subseteq S$.
143. Zermelo (1908) cited in Gillies pp. 52-58. Gillies notes that Dedekind's 1888 work "is the principal source" for Zermelo's 1908 paper, in which "Zermelo frequently refers to Dedekind."
144. Jones § The Formalization of Mathematics
145. Toida 4.1 Why Predicate Logic?
146. Peirce pp. 194-195 cited in Moore p. 99
147. Anellis (2012a) p. 256
148. Reck (2012) 2.2
149. Gillies pp. 74-75
150. HTFB (2015)
151. O’Connor and Robertson (2002)
152. Jones § The Formalization of Mathematics
153. Mattey § Gottlob Frege
154. Frege (1879) cited in Mattey § Gottlob Frege
155. Mattey § Gottlob Frege
156. Harrison (1996) § The History of Formal Logic
157. Harrison (1996) § The History of Formal Logic
158. Frege (1879) cited in Mattey § Gottlob Frege
159. Azzano p. 12
160. Math Stack Exch
161. Boyer p. 644
162. O’Connor and Robertson (2002)
163. Sowa “Comments on Peirce’s …” § 1. Historical Background
164. Sowa § 1. Historical Background
165. Sowa § 1. Historical Background -- emphasis added
166. Moore p. 98
167. See the Historical sketch in Mathematical logic
168. Bezhanishvil p. 1
169. Podnieks § 3.1
170. Kennedy (1963)
171. Peirce (1881) p. 85 cited in Anellis (2012a) pp. 260-261. Anellis notes that, though Peirce uses the word “syllogistic” here, he was already translating syllogisms in his algebraic logic into implications using a conditional connective.
172. Anellis (2012a) p. 259
173. Shields cited by Anellis (2012a) p. 259-260
174. O’Connor and Robertson (2002) "Frege"
175. Gillies pp. 74-75
176. Azzano p. 12
177. Frege (1884) cited in Demopoulos p. 7
178. Frege (1879) p. 136 cited in Gillies p. 71 emphasis added
179. Frege (1884) § 2 cited in ”Philosophical Summaries” emphasis added
180. Frege (1884) § 4 cited in Demopoulos p. 5 emphasis added
181. Frege (1884) cited in Gillies p. 46-48
182. Frege (1884) cited in Dietz
183. Frege (1892)
184. Gillies p. 83
185. Ferreirós (1996) pp. 18-19
186. Azzano p. 10
187. Ferreirós pp. 18-19. Ferreirós notes (with surprise) that, in spite of its importance to naive set theory, the unrestricted principle of Comprehension was almost nowhere stated clearly before it was proved to be contradictory!
188. Harrison (1996)
189. Staub p. 96
190. Gillies p. 66
191. Kennedy (1974) p.41
192. Peano p. 102 cited in GIllies p. 66
193. P. Nidditch, Peano and the Recognition of Frege, Mind 72 (1963) 103-110 cited in Staub p. 96
194. Peano cited in Kennedy (2002) p. 40-41
195. Kennedy (2002) p. 42
196. Kennedy (2002) p. 8
197. Kennedy (2002) p. 42
198. See Peano axioms and Wikipedia § Peano axioms for modern formalizations of Peano’s axioms.
199. Pon p. 5
200. See Peano axioms and Wikipedia § Peano axioms for discussions of consistency and independence of the axioms.
201. Stepanov Slide 31
202. Sowa § 1. Historical Background
203. Wang p. 145 cited in Podnieks p.93
204. Peano (1889) trans. by Kennedy p.103 cited in Gillies p. 66
205. Reck (2011) § 2.2. To further make his case, Reck notes, albeit parenthetically, that “Peano, who published his corresponding work in 1889, [one year after Dedekind published his conditions,] acknowledged Dedekind's priority.”
206. Staub p. 98 emphasis added
207. Kennedy (2002) p. 41 emphasis added
208. Nidditch cited in Staub p. 98
209. Joyce cited in Staub p. 98
210. Kennedy (2002) p. 11
211. Gillies p. 66
212. Boyer p. 654 ff.
213. Boyer p. 658
214. Harrison (1996) § Rigour and the axiomatic method
215. Boyer pp. 657-658. Some modern authors present a somewhat different description of Hilbert's geometry, agreeing for the most part with Boyer about the three undefined objects and the five groups of axioms, but disagreeing about the undefined notions/concepts. Some exclude the notions being parallel and being continuous, since they are not notions of geometry specifically, but of mathematics generally. Others identify additional notions/concepts, for example, associating with the axioms of order not only the notion betweenness, but others related to it, such as sidedness, inside/outside, and bigger/smaller.
216. Sterrett p. 1
217. Corry p. 147
218. Hilbert (1899) p. 1 cited in Venturi (2012) p. 3
219. Boyer p. 658
220. Hilbert cited in Blanchette § 2
221. Blumenthal p. 402-403 cited in Corry (2011) p. 140
222. Corry p. 147
223. Venturi (2012) p. 12. Venturi comments (n. 37) that Hilbert made his choice of axiomatics as the method he would use to establish a sound basis for geometry even though, at the time, he “lacked the logical tools” to implement that method fully.
224. Venturi (2012) p. 3
225. Hilbert (1921-22) cited in Venturi pp. 10-11
226. Hilbert (1900)
227. Hilbert in a letter to Klein cited in Corry p. 141 emphasis added
228. Jahren p. 1
229. Venturi (2012) p. 3 emphasis added
230. Venturi (2012) p. 18
231. Blanchette § 2
232. Blanchette § 2
233. Corry p. 153
234. Blanchette § 2
235. Blanchette § 4
236. Blanchette § 5
237. Corry p. 147
238. Venturi (2012) p. 24
239. Hilbert (1902)
240. Ferreirós (1996) p. 2 Ferreirós notes: “the first published formulation of the idea that mathematical existence can be derived from consistency” appeared in Hilbert’s 1900 paper “Über den Zahlbegriff.” This paper appeared immediately prior to the published version of his Problems Address.
241. Calude and Chaitin
242. Pon

## Primary sources

• Blumenthal, Otto. (1935). “Lebensgeschichte.” (Hilbert 1932–1935, vol. 3, 387–429).
• Bolzano, B. (1851). Paradoxien des Unendlichen (ed. by F. Pryhonsky), Reclam'; [English translation by D. A. Steele, ‘’Paradoxes of the Infinite’’, London: Routledge & Kegan Paul, 1950].
• Boole, G. (1847, [1951]). The Mathematical Analysis of Logic, Being an Essay Towards a Calculus of Deductive Reasoning, Macmillan, Barclay, & Macmillan, [Reprinted Basil Blackwell].
• Boole, G. (1854, [19158]). An Investigation of The Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities, Macmillan, [Reprinte Dover].
• Dedekind, R. (1888). Was sind und was sollen die Zahlen?, Vieweg, [English trans., (1901) “The Nature and Meaning of Numbers”, in Essays on the Theory of Numbers, W.W. Beman, ed. and trans., Open Court Publishing Company].
• Dedekind, R. (1930-32). Gesammelte Mathematische Werke, Vols. 1-3, R. Fricke et al., eds., Vieweg.
• De Morgan, A. (1847). Formal Logic: or, The Calculus of Inference, Necessary and Probable, Taylor and Walton.
• De Morgan, A. (1849). Trigonometry and Double Algebra, Taylor, Walton & Maberly.
• Frege, G. (1879) Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens, [“Conceptual Notation …”, English translation by T W Bynum, Oxford University Press, 1972].
• Frege, G. (1884). Die Grundlagen der Arithmetik, [The Foundations of Arithmetic, English translation J L Austin, Basil Blackwell, 1968].
• Frege, G. (1892) Uber Sinn und Bedeuting, [“On Sense and Reference,” Translations from the Philosophical Writings of Gottlob Frege, Geach and Black (eds.) Blackwell, 1960, pp. 56-78].
• Frege, G. (1893) Grundgesetze, [The Basic Laws of Arithmetic, English translation by M Firth, University of California, 1964].
• Grassmann, H. (1861). Lehrbuch der Arithmetik, Enslin, Berlin.
• Hilbert, D. (1900). “Über den Zahlbegriff,” Jahresbericht der Deutschen, Mathematiker-Vereinigung 8, 180–184. (English translation in Ewald, W. (1996). From Kant to Hilbert: A source book in the foundations of mathematics, vol. 2, Oxford University Press.
• Hilbert, D.(1900). "Mathematische Probleme," Nachr. K. Ges. Wiss. Göttingen, Math.-Phys. Klasse (Göttinger Nachrichten) , 3 pp. 253–297 (Reprint: Archiv Math. Physik 3:1 (1901), 44-63; 213-237; also: Gesammelte Abh., dritter Band, Chelsea, 1965, pp. 290-329) Zbl 31.0068.03, URL: https://www.math.uni-bielefeld.de/~kersten/hilbert/rede.html, Accessed: 2015/06/03.
• Hilbert, D. (1902). "Mathematical problems," Bull. Amer. Math. Soc. , 8 pp. 437–479, MR1557926 Zbl 33.0976.07, (Reprint: ‘’Mathematical Developments Arising from Hilbert Problems’’, edited by Felix Brouder, American Mathematical Society, 1976), URL: http://aleph0.clarku.edu/~djoyce/hilbert/problems.html, Accessed: 2015/06/03.
• Jevons, W S. (1890). Pure Logic and Other Minor Works, Robert Adamson and Harriet A. Jevons (eds), Lennox Hill Pub. & Dist. Co. [Reprinted 1971].
• Peacock, G. (1830). Treatise on Algebra.
• Peirce, C S. (1881). “On the Logic of Number.” American Journal of Mathematics, Vol. 4, pp. 85-95, 1881.
• Schröder, E. (1895). Algebra und Logik der Relativ.
• Zermelo, I. (1908). “Investigations in the Foundations of Set Theory,” [English translation in van Heijenoort, J. (1967) From Frege to Godel, Harvard Univ. Press, pp. 199-215].

## References

• Anellis, I H. (2012b) “Peirce’s truth functional analysis and the origin of the truth table,” History and Philosophy of Logic, Vol. 33, No. 1, pp. 87–97, 2012, URL: http://arxiv.org/pdf/1108.2429.pdf, Accessed: 2015/08/07.
• Bochenski, I M. (1956,[1961]) Formale Logik, North Holland, [English translation A History of Formal Logic, trans by Ivo Thomas, University of Notre Dame Press].
• Boyer, C.B. (1939). The Concepts of the Calculus. A Critical and Historical Discussion of the Derivative and the Integral, Columbia University Press, vii + 346 pages, URL: http://catalog.hathitrust.org/Record/000165835 Accessed: 2015/06/29.
• Chaitin, G. (2000). “A Century of Controversy Over the Foundations of Mathematics,“ Journal Complexity -- Special Issue: Limits in mathematics and physics, Vol. 5, No. 5, May-June 2000, pp. 12-21, (Originally published in Finite Versus Infinite: Contributions to an Eternal Dilemma, Calude, C. S.; Paun, G. (eds.); Springer-Verlag, London, 2000, pp. 75–100), URL: http://www-personal.umich.edu/~twod/sof/assignments/chaitin.pdf Accessed 2015/05/30.
• Corry, L. (2006). “The Origin of Hilbert’s Axiomatic Method,” Jürgen Renn et al (eds.). The Genesis of General Relativity, Vol. 4 Theories of Gravitation in the Twilight of Classical Physics: The Promise of Mathematics and the Dream of a Unified Theory, Springer (2006), pp. 139-236. URL: http://www.tau.ac.il/~corry/publications/articles/pdf/Hilbert%20Kluwer.pdf, Accessed: 2015/08/16.
• Dasgupta, A. (2014). Set Theory: With an Introduction to Real Point Sets, DOI 10.1007/978-1-4614-8854-5__2, © Springer Science+Business Media New York 2014, URL: http://www.springer.com/us/book/9781461488538, Accessed: 2015/06/19.
• Ebbinghaus, H., et al. (1992: 3rd improved printing). Zahlen. Springer-Verlag.
• Ewald, W B. (1996). From Kant to Hilbert: A source book in the foundations of mathematics, 2 vols., Oxford University Press.
• Ewald, W B. (2002) Review of Grattan-Guinness, I. (2000) The Search for Mathematical Roots, 1870-1940, Princeton University Press. Bull. (New Series) Amer. Math. Soc., Vol. 40, No. 1, pp. 125–129.
• Ferreirós, J. (2001). “The Road to Modern Logic -- An Interpretation,” ‘’The Bulletin of Symbolic Logic’’, Vol. 7, No. 4, Dec. 2001, URL: http://personal.us.es/josef/BSL0704-001.pdf, Accessed: 2015/07/13.
• Grattan-Guinness, I. (1974). The rediscovery of the Cantor-Dedekind correspondence, Jahresbericht der Deutschen Mathematiker-Vereinigung 76 #2-3 (30 December 1974), 104-139, URL: http://catalog.hathitrust.org/Record/000165835 Accessed: 2015/06/30.
• Grattan-Guinness, I. (1991). "Boole y su semi-seguidor jevons," ["Boole and his semi-follower Jevons"], in 2nd International Colloquium on Philosophy and History of Mathematics, Mexico City, Mathesis Mexico, Vol. 7. No. 3, (1991), pp. 351-362.
• Joyce, D. (2005). The Dedekind/Peano Axioms, Clark University Press.
• Kanamori, A. (2012). “In Praise of Replacement,” Bull. Symbolic Logic Vol. 18, No. 1 (2012), pp. 46-90.
• Netz, R, Saito, K, and Tchernetska, N. (2001). “A new reading of Method Proposition 14 : preliminary evidence from the Archimedes palimpsest. I, SCIAMVS 2 (2001), 9-29.
• Nidditch, P. (1963). “Peano and the Recognition of Frege,” Mind, Vol. 72 (1963) pp. 103-110.
• Russell, B. (1945, [1972]) A History of Western Philosophy, Simon & Schuster, Inc.
• Spalt, D.D. (1990). "Die Unendlichkeiten bei Bernard Bolzano," Konzepte des mathematisch Unendlichen im 19. Jahrhundert, Göttingen, 189-218.
• Tarski, Alfred. (1941). “On the Calculus of Relations,” The Journal of Symbolic Logic, Vol. 6, No. 3 (Sep., 1941), pp. 73-89, Association for Symbolic Logic, URL: http://www.jstor.org/stable/2268577, Accessed: 2015/07/09.
• Waterhouse, W.C. (1979). “Gauss on infinity,” Historia Math. Vol. 6, Issue 4, November 1979, pp. 430-436.
How to Cite This Entry:
Hilbert 2nd problem. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Hilbert_2nd_problem&oldid=36651