Gentzen's systems of natural deduction and sequent calculus were byproducts in his program of proving the consistency of arithmetic and analysis. It is suggested that the central component in his results on logical calculi was the use of a tree form for derivations. It allows the composition of derivations and the permutation of the order of application of rules, with a full control over the structure of derivations as a result. Recently found documents shed new light on the discovery of (...) these calculi. In particular, Gentzen set up five different forms of natural calculi and gave a detailed proof of normalization for intuitionistic natural deduction. An early handwritten manuscript of his thesis shows that a direct translation from natural deduction to the axiomatic logic of Hilbert and Ackermann was, in addition to the influence of Paul Hertz, the second component in the discovery of sequent calculus. A system intermediate between the sequent calculus LI and axiomatic logic, denoted LIG in unpublished sources, is implicit in Gentzen's published thesis of 1934—35. The calculus has half rules, half “groundsequents,” and does not allow full cut elimination. Nevertheless, a translation from LI to LIG in the published thesis gives a subformula property for a complete class of derivations in LIG. After the thesis, Gentzen continued to work on variants of sequent calculi for ten more years, in the hope to find a consistency proof for arithmetic within an intuitionistic calculus. (shrink)

This article presents Tarski's Address at the Princeton Bicentennial Conference on Problems of Mathematics, together with a separate summary. Two accounts of the discussion which followed are also included. The central topic of the Address and of the discussion is decision problems. The introductory note gives information about the Conference, about the background of the subjects discussed in the Address, and about subsequent developments to these subjects.

In Untersuchungen zur allgemeinen Axiomatik and Abriss der Logistik, Carnap attempted to formulate the metatheory of axiomatic theories within a single, fully interpreted type-theoretic framework and to investigate a number of meta-logical notions in it, such as those of model, consequence, consistency, completeness, and decidability. These attempts were largely unsuccessful, also in his own considered judgment. A detailed assessment of Carnap’s attempt shows, nevertheless, that his approach is much less confused and hopeless than it has often been made out to (...) be. By providing such a reassessment, the paper contributes to a reevaluation of Carnap’s contributions to the development of modern logic. (shrink)

Frege explained the notion of generality by stating that each its instance is a fact, and added only later the crucial observation that a generality can be inferred from an arbitrary instance. The reception of Frege’s quantifiers was a fifty-year struggle over a conceptual priority: truth or provability. With the former as the basic notion, generality had to be faced as an infinite collection of facts, whereas with the latter, generality was based on a uniformity with a finitary sense: the (...) provability of an arbitrary instance. (shrink)

Gödel always claimed that he did not know Skolem's Helsinki lecture when writing his dissertation. Some questions and doubts have been raised about this claim, in particular on the basis of a library slip showing that he had requested Skolem's paper in 1928. It is shown that this library slip does not constitute evidence against Gödel's claim, and that, on the contrary, the library slip and other archive material actually corroborate what Gödel said.

In this article my primary intention is to engage in a discussion on the inherent constraints of models, taken as models of theories, that reaches beyond the epistemological level. Naturally the paper takes into account the ongoing debate between proponents of the syntactic and the semantic view of theories and that between proponents of the various versions of scientific realism, reaching down to the most fundamental, subjective level of discourse. In this approach, while allowing for a limited discussion of physical (...) and positive science models, I am primarily focused on the structure and ontology of mathematical models, in particular Cohen’s forcing models and to a lesser extent Gödel’s constructible universe, to the extent that these were designed to answer questions bearing on the scope, the capacity and ultimately the ontology of models themselves, therefore influencing in one or the other way the status of models in general. This status, it is argued, is largely defined by the way models subsume a set-theoretical structure whose constraints, reducible to an extra-linguistic level of discourse, may implicitly condition the epistemic status of models as representations of axiomatic theories. In the last section I deal extensively with the inner constraints of theories as subjectively originated in a less technical philosophically oriented discussion with certain prompts from phenomenology. (shrink)

Ernst Friedrich Ferdinand Zermelo transformed the set theory of Cantor and Dedekind in the first decade of the 20th century by incorporating the Axiom of Choice and providing a simple and workable axiomatization setting out generative set-existence principles. Zermelo thereby tempered the ontological thrust of early set theory, initiated the delineation of what is to be regarded as set-theoretic, drawing out the combinatorial aspects from the logical, and established the basic conceptual framework for the development of modern set theory. Two (...) decades later Zermelo promoted a distinctive cumulative hierarchy view of models of set theory and championed the use of infinitary logic, anticipating broad modern developments. In this paper Zermelo's published mathematical work in set theory is described and analyzed in its historical context, with the hindsight afforded by the awareness of what has endured in the subsequent development of set theory. Elaborating formulations and results are provided, and special emphasis is placed on the to and fro surrounding the Schröder-Bernstein Theorem and the correspondence and comparative approaches of Zermelo and Gödel. Much can be and has been written about philosophical and biographical issues and about the reception of the Axiom of Choice, and we will refer and defer to others, staying the course through the decidedly mathematical themes and details. (shrink)

Set theory is an autonomous and sophisticated field of mathematics, enormously successful not only at its continuing development of its historical heritage but also at analyzing mathematical propositions cast in set-theoretic terms and gauging their consistency strength. But set theory is also distinguished by having begun intertwined with pronounced metaphysical attitudes, and these have even been regarded as crucial by some of its great developers. This has encouraged the exaggeration of crises in foundations and of metaphysical doctrines in general. However, (...) set theory has proceeded in the opposite direction, from a web of intensions to a theory of extensionpar excellence, and like other fields of mathematics its vitality and progress have depended on a steadily growing core of mathematical structures and methods, problems and results. There is also the stronger contention that from the beginning set theory actually developed through a progression ofmathematicalmoves, whatever and sometimes in spite of what has been claimed on its behalf.What follows is an account of the development of set theory from its beginnings through the creation of forcing based on these contentions, with an avowedly Whiggish emphasis on the heritage that has been retained and developed by current set theory. The whole transfinite landscape can be viewed as the result of Cantor's attempt to articulate and solve the Continuum Problem. (shrink)

Finitism is given an interpretation based on two ideas about strings (sequences of symbols): a replacement principle extracted from Hilberts class 2 can be justified by means of an additional finitistic choice principle, thus obtaining a second equational theory . It is unknown whether is strictly stronger than since 2 may coincide with the class of lower elementary functions.

What we call the Hilbert‐Bernays (HB) Theorem establishes that for any satisfiable first‐order quantificational schema S, there are expressions of elementary arithmetic that yield a true sentence of arithmetic when they are substituted for the predicate letters in S. Our goals here are, first, to explain and defend W. V. Quine's claim that the HB theorem licenses us to define the first‐order logical validity of a schema in terms of predicate substitution; second, to clarify the theorem by sketching an accessible (...) and illuminating new proof of it; and, third, to explain how Quine's substitutional definition of logical notions can be modified and extended in ways that make it more attractive to contemporary logicians. (shrink)

That every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor easily found in the literature. Various approaches to the result are presented and discussed in detail, including one inspired by a problem in the proof theory of intermediate logics that led us to the proof of the present paper. It can (...) be seen as a modification of Skolem’s argument from 1920 for his “Normal Form” theorem. “Geometric” being the infinitary version of “coherent”, it is further shown that every infinitary first-order theory, suitably restricted, has a geometric conservative extension, hence the title. The results are applied to simplify methods used in reasoning in and about modal and intermediate logics. We include also a new algorithm to generate special coherent implications from an axiom, designed to preserve the structure of formulae with relatively little use of normal forms. (shrink)

One of the most significant discoveries of early twentieth century mathematical logic was a workable definition of ‘ordered pair’ totally within set theory. Norbert Wiener, and independently Casimir Kuratowski, are usually credited with this discovery. A definition of ‘ordered pair’ held the key to the precise formulation of the notions of ‘relation’ and ‘function’ — both of which are probably indispensable for an understanding of the foundations of mathematics. The set-theoretic definition of ‘ordered pair’ thus turned out to be a (...) key victory for logicism, providing one admits set theory is logic. The definition also was instrumental in achieving the appearance of ontological economy — since it seemed only sets were needed — although this feature was emphasized only later. (shrink)