An introduction to the developments of nonstandard models. Beginning with Godel's incompleteness theorem, it covers the prime models, cofinal extensions, and extensions, Gaifman's construction of a definable type, Tennenbaum's theorem and Friedman's theorem on indicators, ending with a chapter on recursive saturation and resplendency.

This book, written by one of the most distinguished of contemporary philosophers of mathematics, is a fully rewritten and updated successor to the author's earlier The Unprovability of Consistency. Its subject is the relation between provability and modal logic, a branch of logic invented by Aristotle but much disparaged by philosophers and virtually ignored by mathematicians. Here it receives its first scientific application since its invention. Modal logic is concerned with the notions of necessity and possibility. What George Boolos does (...) is to show how the concepts, techniques, and methods of modal logic shed brilliant light on the most important logical discovery of the twentieth century: the incompleteness theorems of Kurt Godel and the 'self-referential' sentences constructed in their proof. The book explores the effects of reinterpreting the notions of necessity and possibility to mean provability and consistency. (shrink)

PA is Peano arithmetic. The formula $\operatorname{Interp}_\mathrm{PA}(\alpha, \beta)$ is a formalization of the assertion that the theory PA + α interprets the theory PA + β (the variables α and β are intended to range over codes of sentences of PA). We extend Solovay's modal analysis of the formalized provability predicate of PA, Pr PA (x), to the case of the formalized interpretability relation $\operatorname{Interp}_\mathrm{PA}(x, y)$ . The relevant modal logic, in addition to the usual provability operator `□', has a (...) binary operator ` $\triangleright$ ' to be interpreted as the formalized interpretability relation. We give an axiomatization and a decision procedure for the class of those modal formulas that express valid interpretability principles (for every assignment of the atomic modal formulas to sentences of PA). Our results continue to hold if we replace the base theory PA with Zermelo-Fraenkel set theory, but not with Gödel-Bernays set theory. This sensitivity to the base theory shows that the language is quite expressive. Our proof uses in an essential way earlier work done by A. Visser, D. de Jongh, and F. Veltman on this problem. (shrink)

Theories in the usual sense, as characterized by a language and a set of theorems in that language ("statement view"), are related to theories in the structuralist sense, in turn characterized by a set of potential models and a subset thereof as models ("non-statement view", J. Sneed, W. Stegmüller). It is shown that reductions of theories in the structuralist sense (that is, functions on structures) give rise to so-called "representations" of theories in the statement sense and vice versa, where representations (...) are understood as functions that map sentences of one theory into another theory. It is argued that commensurability between theories should be based on functions on open formulas and open terms so that reducibility does not necessarily imply commensurability. This is in accordance with a central claim by Stegmüller on the compatibility of reducibility and incommensurability that has recently been challenged by D. Pearce. (shrink)

Four current accounts of theory reduction are presented, first informally and then formally: (1) an account of direct theory reduction that is based on the contributions of Nagel, Woodger, and Quine, (2) an indirect reduction paradigm due to Kemeny and Oppenheim, (3) an "isomorphic model" schema traceable to Suppes, and (4) a theory of reduction that is based on the work of Popper, Feyerabend, and Kuhn. Reference is made, in an attempt to choose between these schemas, to the explanation of (...) physical optics by Maxwell's electromagnetic theory, and to the revisions of genetics necessitated by partial biochemical reductions of genetics. A more general reduction schema is proposed which: (1) yields as special cases the four reduction paradigms considered above, (2) seems to be in better accord with both the canons of logic and actual scientific practice, and (3) clarifies the problems of meaning variance and ontological reduction. (shrink)

The Three Papers comprising this series, together with my earlier [34] also published in this journal, constitute an attempt to set out the major issues in the theoretical domain of reduction and to develop a general theory of theory reduction. The fourth paper, [34], though published separately from this trio, is integral to the presentation and should be read in conjunction with these papers. Even so, the presentation is limited in scope – roughly, to intertheoretic reduction among empirical theories – (...) and informal in presentation – not least because a satisfying formal account of theories has yet to be offered. And despite the length, the treatment is still condensed; often corroborating and/or intuitively helpful detail has had to be consigned to footnotes or omitted. I approach the problem from within my own naturalistic realist philosophy of science and formal analysis of abstract hierarchy in theory. The sources for the former are [25], [29], [31], and [32] and those for the latter essentially [27] and [30]. Hierarchical notions played a significant role in the already published [34]. (shrink)

A definition of elementary interpretation, equivalent (up to isomorphisms) to the ones of [3] and [4], is given. The defining condition, used here, seems to confirm that intuitions agree with the choice of the class of elementary interpretations, which was done in [3].

We say that a semantical function is correlated with a syntactical function F iff for any structure A and any sentence we have A F A .It is proved that for a syntactical function F there is a semantical function correlated with F iff F preserves propositional connectives up to logical equivalence. For a semantical function there is a syntactical function F correlated with iff for any finitely axiomatizable class X the class –1X is also finitely axiomatizable (i.e. iff is (...) continuous in model class topology). (shrink)

The conditions are examined under which one theory is said to be replaceable by another, while preserving those features of the original theory which made it serviceable for a given purpose. Among such replacements, special attention is given to ones which qualify as so-called reductions of a theory, and some theorems are proved concerning the notion of a reduction.