Putnam famously attempted to use model theory to draw metaphysical conclusions. His Skolemisation argument sought to show metaphysical realists that their favourite theories have countable models. His permutation argument sought to show that they have permuted models. His constructivisation argument sought to show that any empirical evidence is compatible with the Axiom of Constructibility. Here, I examine the metamathematics of all three model-theoretic arguments, and I argue against Bays (2001, 2007) that Putnam is largely immune to metamathematical challenges.

Frege’s project has been characterized as an attempt to formulate a complete system of logic adequate to characterize mathematical theories such as arithmetic and set theory. As such, it was seen to fail by Gödel’s incompleteness theorem of 1931. It is argued, however, that this is to impose a later interpretation on the word ‘complete’ it is clear from Dedekind’s writings that at least as good as interpretation of completeness is categoricity. Whereas few interesting first-order mathematical theories are categorical or (...) complete, there are logical extensions of these theories into second-order and by the addition of generalized quantifiers which are categorical. Frege’s project really found success through Gödel’s completeness theorem of 1930 and the subsequent development of first- and higher-order model theory. (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.

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...) and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

Attention is drawn to the fact that what is alternatively known as Dummett logic, Gödel logic, or Gödel-Dummett logic, was actually introduced by Skolem already in 1913. A related work of 1919 introduces implicative lattices, or Heyting algebras in today's terminology.

Let T 0?T 1 denote that each computable function, which is provable total in the first order theory T 0, is also provable total in the first order theory T 1. Te relation ? induces a degree structure on the sound finite Π2 extensions of EA (Elementary Arithmetic). This paper is devoted to the study of this structure. However we do not study the structure directly. Rather we define an isomorphic subrecursive degree structure <≤,?>, and then we study <≤,?> by (...) ubrecursive and computability-theoretic means. Furthermore, we introduce and investigate some operators on the degrees of <≤,?>. These operators corresponds to inferencerules in formal arithmetic. One operator corresponds to the Σ1 collection rule. Another operator corresponds to the Σ1 induction rule. (shrink)

Towards the end of his 1930 paper on boundary numbers and domains of sets Zermelo briefly discusses the questions of consistency and of the existence of an unbounded sequence of strongly inaccessible cardinals, deferring a detailed discussion to a later paper which never appeared. In a report to the Emergency Community of German Science from December 1930 about investigations in progress he mentions that some of the intended extensions of these topics had been worked out and were nearly ready for (...) publication. Using manuscripts from his Nachlass, we exhibit essential features of these extensions. (shrink)

SummaryFinite, or Fermat arithmetic, as we call it, differs from Peano arithmetic in that it does not involve the existence of an infinite set or Peano's induction postulate. Fermat's method of infinite descent takes the place of bound induction, and we show that a con‐structivist interpretation of logical connectives and quantifiers can account for the predicative finitary nature of Fermat's arithmetic. A non‐set‐theoretic arithemetical logic thus seems best suited to a constructivist‐inspired number theory.

The dream of a community of philosophers engaged in inquiry with shared standards of evidence and justification has long been with us. It has led some thinkers puzzled by our mathematical experience to look to mathematics for adjudication between competing views. I am skeptical of this approach and consider Skolem's philosophical uses of the Löwenheim-Skolem Theorem to exemplify it. I argue that these uses invariably beg the questions at issue. I say ?uses?, because I claim further that Skolem shifted his (...) position on the philosophical significance of the theorem as a result of a shift in his background beliefs. The nature of this shift and possible explanations for it are investigated. Ironically, Skolem's own case provides a historical example of the philosophical flexibility of his theorem. Our suspicion ought always to be aroused when a proof proves more than its means allow it. Something of this sort might be called ?a puffed-up proof?. Ludwig Wittgenstein, Remarks on the foundations of mathematics (revised edition), vol. 2, 21. (shrink)

This paper investigates the ontological presuppositions of quantifier logic. It is seen that the actual infinite, although present in the usual completeness proofs, is not needed for a proper semantic foundation. Additionally, quantifier logic can be given an adequate formulation in which neither the notion of individual nor that of a predicate appears.

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.

This article outlines the work of a group of US mathematicians called the American Postulate Theorists and their influence on Tarski's work in the 1930s that was to be foundational for model theory. The American Postulate Theorists were influenced by the European foundational work of the period around 1900, such as that of Peano and Hilbert. In the period roughly from 1900???1940, they developed an indigenous American approach to foundational investigations. This made use of interpretations of precisely formulated axiomatic theories (...) to prove such metatheoretic properties as independence, consistency, categoricity and, in some cases, completeness of axiom sets. This approach to foundations was in many respects similar to that later taken by Tarski, who frequently cites the work of American Postulate Theorists. Their work served as paradigm examples of the theories and concepts investigated in model theory. The article also examines the possibility of a more specific impetus to Tarski's model theoretic investigation, arising from his having studied in 1927???1929 a paper by C. H. Langford proving completeness for various axiom sets for linear orders. This used the method of elimination of quantifiers. The article concludes with an examination of one example of Langford's methods to indicate how their correct formulation seems to call for model-theoretic concepts. (shrink)

This essay will be divided into three parts. In the first part, we discuss the case of infintesimals seen as a bridge between the discrete and the continuous. This leads in the second part to a discussion of the nature of numbers. In the last part, we follow up with some observations on the obvious applicability of mathematics.