We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property.

By a classical result of Kotlarski, Krajewski and Lachlan, pathological satisfaction classes can be constructed for countable, recursively saturated models of Peano arithmetic. In this paper we consider the question of whether the pathology can be eliminated; we ask in effect what generalities involving the notion of truth can be obtained in a deflationary truth theory (a theory of truth which is conservative over its base). It is shown that the answer depends on the notion of pathology we adopt. It (...) turns out in particular that a certain natural closure condition imposed on a satisfaction class—namely, closure of truth under sentential proofs—generates a nonconservative extension of a syntactic base theory (Peano arithmetic). (shrink)

Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.

This paper attempts to address the question what logical strength theories of truth have by considering such questions as: If you take a theory T and add a theory of truth to it, how strong is the resulting theory, as compared to T? It turns out that, in a wide range of cases, we can get some nice answers to this question, but only if we work in a framework that is somewhat different from those usually employed in discussions of (...) axiomatic theories of truth. These results are then used to address a range of philosophical questions connected with truth, such as what Tarski meant by "essential richness" and the so-called conservativeness argument against deflationism. -/- This draft dates from about 2009, with some significant updates having been made around 2011. Around then, however, I decided that the paper was becoming unmanageable and that I was trying to do too many things in it. I have therefore exploded the paper into several pieces, which will be published separately. These include "Disquotationalism and the Compositional Principles", "The Logical Strength of Compositional Principles", "Consistency and the Theory of Truth", and "What Is Essential Richness?" You should probably read those instead, since this draft remains a bit of a mess. Terminology and notation are inconsistent, and some of the proofs aren't quite right. So, caveat lector. I make it public only because it has been cited in a few places now. (shrink)

Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ${\mathtt{{Prov}_{\mathsf {PA}} \rightarrow \varphi }}$ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory $\mathsf {T}$ or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between reflection principles (...) and principles of mathematical and transfinite induction as well as the status of the latter with respect to various foundational characterizations of number theory. (shrink)

We shall use Gödel’s Second Incompleteness Theorem to show that consistency is not possibility, and then argue that the argument does serious damage to some theories of modality where consistency plays a major but not exclusive role.

The primary purpose of this note is to demonstrate that predicative Frege arithmetic naturally interprets certain weak but non-trivial arithmetical theories. It will take almost as long to explain what this means and why it matters as it will to prove the results.

A crucial part of the contemporary interest in logicism in the philosophy of mathematics resides in its idea that arithmetical knowledge may be based on logical knowledge. Here an implementation of this idea is considered that holds that knowledge of arithmetical principles may be based on two things: (i) knowledge of logical principles and (ii) knowledge that the arithmetical principles are representable in the logical principles. The notions of representation considered here are related to theory-based and structure-based notions of representation (...) from contemporary mathematical logic. It is argued that the theory-based versions of such logicism are either too liberal (the plethora problem) or are committed to intuitively incorrect closure conditions (the consistency problem). Structure-based versions must on the other hand respond to a charge of begging the question (the circularity problem) or explain how one may have a knowledge of structure in advance of a knowledge of axioms (the signature problem). This discussion is significant because it gives us a better idea of what a notion of representation must look like if it is to aid in realizing some of the traditional epistemic aims of logicism in the philosophy of mathematics. (shrink)

Computationalism holds that our grasp of notions like ‘computable function’ can be used to account for our putative ability to refer to the standard model of arithmetic. Tennenbaum's Theorem has been repeatedly invoked in service of this claim. I will argue that not only do the relevant class of arguments fail, but that the result itself is most naturally understood as having the opposite of a reference-fixing effect — i.e., rather than securing the determinacy of number-theoretic reference, Tennenbaum's Theorem points (...) towards a sense in which portions of our computational vocabulary should be regarded as model-relative. (shrink)

In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. First, we show that first-order theories of finite signature that have functional non-surjective ordered pairing are definitionally equivalent to extensions in the same language of the basic theory of non-surjective ordered pairing. Second, we show that a first-order theory of finite signature is sequential (is a theory of sequences) iff it is (...) definitionally equivalent to an extension in the same language of a system of weak set theory called WS. (shrink)

In this paper we show that the degrees of interpretability of finitely axiomatized extensions-in-the-same-language of a finitely axiomatized sequential theory—like Elementary Arithmetic EA, IΣ1, or the Gödel–Bernays theory of sets and classes GB—have suprema. This partially answers a question posed by Švejdar in his paper (Commentationes Mathematicae Universitatis Carolinae 19:789–813, 1978). The partial solution of Švejdar’s problem follows from a stronger fact: the convexity of the degree structure of finitely axiomatized extensions-in-the-same-language of a finitely axiomatized sequential theory in the degree (...) structure of the degrees of all finitely axiomatized sequential theories. In the paper we also study a related question: the comparison of structures for interpretability and derivability. In how far can derivability mimic interpretability? We provide two positive results and one negative result. (shrink)

We study the effective and proof-theoretic content of the polarized Ramsey’s theorem, a variant of Ramsey’s theorem obtained by relaxing the definition of homogeneous set. Our investigation yields a new characterization of Ramsey’s theorem in all exponents, and produces several combinatorial principles which, modulo bounding for ${\Sigma^0_2}$ formulas, lie (possibly not strictly) between Ramsey’s theorem for pairs and the stable Ramsey’s theorem for pairs.

We prove that the Gödel incompleteness theorem holds for a weak arithmetic T = IΔ0 + Ω2 in the form where Cons H (T) is an arithmetic formula expressing the consistency of T with respect to the Herbrand notion of provability.

We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property.

As is well-known, the formal system in which Frege works in his Grundgesetze der Arithmetik is formally inconsistent, Russell’s Paradox being derivable in it.This system is, except for minor differ...

By combining some technical results from metamathematicalinvestigations of systems of Bounded Arithmetic, I will givean argument for the untenability of Nelson 's finitistic program,encapsulated in his book Predicative Arithmetic.

Storrs McCall continues the tradition of Lucas and Penrose in an attempt to refute mechanism by appealing to Gödel’s incompleteness theorem. That is, McCall argues that Gödel’s theorem “reveals a sharp dividing line between human and machine thinking”. According to McCall, “[h]uman beings are familiar with the distinction between truth and theoremhood, but Turing machines cannot look beyond their own output”. However, although McCall’s argumentation is slightly more sophisticated than the earlier Gödelian anti-mechanist arguments, in the end it fails badly, (...) as it is at odds with the logical facts. (shrink)

We study Basic Arithmetic, $$\textsf{BA}$$ introduced by Ruitenburg (Notre Dame J Formal Logic 39:18–46, 1998). $$\textsf{BA}$$ is an arithmetical theory based on basic logic which is weaker than intuitionistic logic. We show that the class of the provably total recursive functions of $$\textsf{BA}$$ is a proper sub-class of the primitive recursive functions. Three extensions of $$\textsf{BA}$$, called $$\textsf{BA}+\mathsf U$$, $$\mathsf {BA_{\mathrm c}}$$ and $$\textsf{EBA}$$ are investigated with relation to their provably total recursive functions. It is shown that the provably total (...) recursive functions of these three extensions of $$\textsf{BA}$$ are exactly the primitive recursive functions. Moreover, among other things, it is shown that the well-known MRDP theorem does not hold in $$\textsf{BA}$$, $$\textsf{BA}+\mathsf U$$, $$\mathsf {BA_{\mathrm c}}$$, but holds in $$\textsf{EBA}$$. (shrink)

The knower paradox states that the statement ‘We know that this statement is false’ leads to inconsistency. This article presents a fresh look at this paradox and some well-known solutions from the literature. Paul Égré discusses three possible solutions that modal provability logic provides for the paradox by surveying and comparing three different provability interpretations of modality, originally described by Skyrms, Anderson, and Solovay. In this article, some background is explained to clarify Égré’s solutions, all three of which hinge on (...) intricacies of provability logic and its arithmetical interpretations. To check whether Égré’s solutions are satisfactory, we use the criteria for solutions to paradoxes defined by Susan Haack and we propose some refinements of them. This article aims to describe to what extent the knower paradox can be solved using provability logic and to what extent the solutions proposed in the literature satisfy Haack’s criteria. Finally, the article offers some reflections on the relation between knowledge, proof, and provability, as inspired by the knower paradox and its solutions. (shrink)

A standard formalization of a scientific theory is a system of axioms for that theory in a first-order language (possibly many-sorted; possibly with the membership primitive $$\in$$ ). Suppes (in: Carvallo M (ed) Nature, cognition and system II. Kluwer, Dordrecht, 1992) expressed skepticism about whether there is a “simple or elegant method” for presenting mathematicized scientific theories in such a standard formalization, because they “assume a great deal of mathematics as part of their substructure”. The major difficulties amount to these. (...) First, as the theories of interest are mathematicized, one must specify the underlying applied mathematics base theory, which the physical axioms live on top of. Second, such theories are typically geometric, concerning quantities or trajectories in space/time: so, one must specify the underlying physical geometry. Third, the differential equations involved generally refer to coordinate representations of these physical quantities with respect to some implicit coordinate chart, not to the original quantities. These issues may be resolved. Once this is done, constructing standard formalizations is not so difficult—at least for the theories where the mathematics has been worked out rigorously. Here we give what may be claimed to be a simple and elegant means of doing that. This is for mathematicized scientific theories comprising differential equations for $$\mathbb{R}$$ -valued quantities Q (that is, scalar fields), defined on n (“spatial” or “temporal”) dimensions, taken to be isomorphic to the usual Euclidean space $$\mathbb{R}^n$$. For illustration, I give standard (in a sense, “text-book”) formalizations: for the simple harmonic oscillator equation in one-dimension and for the Laplace equation in two dimensions. (shrink)

We investigate which part of Brouwer’s Intuitionistic Mathematics is finitistically justifiable or guaranteed in Hilbert’s Finitism, in the same way as similar investigations on Classical Mathematics (i.e., which part is equiconsistent with$\textbf {PRA}$or consistent provably in$\textbf {PRA}$) already done quite extensively in proof theory and reverse mathematics. While we already knew a contrast from the classical situation concerning the continuity principle, more contrasts turn out: we show that several principles are finitistically justifiable or guaranteed which are classically not. Among them (...) are:(i)fan theorem for decidable fans but arbitrary bars;(ii)continuity principle and the axiom of choice both for arbitrary formulae; and(iii)$\Sigma _2$induction and dependent choice. We also show that Markov’s principle MP does not change this situation; that neither does lesser limited principle of omniscience LLPO (except the choice along functions); but that limited principle of omniscience LPO makes the situation completely classical. (shrink)

The notion of implicit commitment has played a prominent role in recent works in logic and philosophy of mathematics. Although implicit commitment is often associated with highly technical studies, it remains so far an elusive notion. In particular, it is often claimed that the acceptance of a mathematical theory implicitly commits one to the acceptance of a Uniform Reflection Principle for it. However, philosophers agree that a satisfactory analysis of the transition from a theory to its reflection principle is still (...) lacking. We provide an axiomatization of the minimal commitments implicit in the acceptance of a mathematical theory. The theory entails that the Uniform Reflection Principle is part of one's implicit commitments, and sheds light on the reason why this is so. We argue that the theory has interesting epistemological consequences in that it explains how justified belief in the axioms of a theory can be preserved to the corresponding reflection principle. The theory also improves on recent proposals for the analysis of implicit commitment based on truth or epistemic notions. (shrink)

PLEASE NOTE: This is the corrected 2nd eBook edition, 2021. ●●●●● _Critique of Impure Reason_ has now also been published in a printed edition. To reduce the otherwise high price of this scholarly, technical book of nearly 900 pages and make it more widely available beyond university libraries to individual readers, the non-profit publisher and the author have agreed to issue the printed edition at cost. ●●●●● The printed edition was released on September 1, 2021 and is now available through (...) all booksellers, including Barnes & Noble, Amazon, and brick-and-mortar bookstores under ISBN 978-0-578-88646-6. ●●●●● In light of the length of this book, readers who would like to have a more detailed description of the book's objectives and method may find it helpful to read the detailed and clearly written Wikipedia entry about this work: From the Wikipedia search page, use the search phrase "Critique of Impure Reason". At least at the time of this writing (11/29/2021), the Wikipedia entry is well-researched and accurate. ●●●●● In addition, a "Primer on Bartlett's CRITIQUE OF IMPURE REASON" has been made available by the author. It is available under its title through PhilPapers and other philosophy online archives. ●●●●● COMMENDATIONS OF THIS WORK, from the back cover of the published edition: ●●●●● “I admire its range of philosophical vision.” – Nicholas Rescher, Distinguished University Professor of Philosophy, University of Pittsburgh, author of more than 100 books. ●●●●● “Bartlett’s _Critique of Impure Reason_ is an impressive, bold, and ambitious work. Careful scholarship is balanced by original analyses that lead the reader to recognize the limits of meaning, knowledge, and conceptual possibility. The work addresses a host of traditional philosophical problems, among them the nature of space, time, causality, consciousness, the self, other minds, ontology, free will and determinism, and others. The book culminates in a fascinating and profound new understanding of relativity physics and quantum theory.” – Gerhard Preyer, Professor of Philosophy, Goethe-University, Frankfurt am Main, Germany, author of many books including _Concepts of Meaning_, _Beyond Semantics and Pragmatics_, _Intention and Practical Thought_, and _Contextualism in Philosophy_. ●●●●● “[This work’s] goal is of a unique and difficult species: Dr. Bartlett seeks to develop a formal logical calculus on the basis of transcendental philosophical arguments; in fact, he hopes that this calculus will be the formal expression of the transcendental foundation of knowledge.... I consider Dr. Bartlett’s work soundly conceived and executed with great skill.” – C. F. von Weizsäcker, philosopher and physicist, former Director, Max-Planck-Institute, Starnberg, Germany. ●●●●● “Bartlett has written an American “Prolegomena to All Future Metaphysics.” He aims rigorously to eliminate meaningless assertions, reach bedrock, and place philosophy on a firm foundation that will enable it, like science and mathematics, to produce lasting results that generations to come can build on. This is a great book, the fruit of a lifetime of research and reflection, and it deserves serious attention.” — Martin X. Moleski, former Professor, Canisius College, Buffalo, NY, studies of scientific method, the presuppositions of thought, and the self-referential nature of epistemology. ●●●●● “Bartlett has written a book on what might be called the underpinnings of philosophy. It has fascinating depth and breadth, and is all the more striking due to its unifying perspective based on the concepts of reference and self-reference.” – Don Perlis, Professor of Computer Science, University of Maryland, author of numerous publications on self-adjusting autonomous systems and philosophical issues concerning self-reference, mind, and consciousness. ●●●●● ●●●●● The _Critique of Impure Reason: Horizons of Possibility and Meaning_ comprises a major and important contribution to philosophy. Thanks to the generosity of its publisher, this massive 885-page volume has been published as a free open access eBook (3.75MB) as well as an open access printed edition. It inaugurates a revolutionary paradigm shift in philosophical thought by providing compelling and long-sought-for solutions to a wide range of philosophical problems. In the process, the work fundamentally transforms the way in which the concepts of reference, meaning, and possibility are understood. The book includes a Foreword by the celebrated German philosopher and physicist Carl Friedrich von Weizsäcker. ●●●●● In Kant’s _Critique of Pure Reason_ we find an analysis of the preconditions of experience and of knowledge. In contrast, but yet in parallel, the new _Critique_ focuses upon the ways—unfortunately very widespread and often unselfconsciously habitual—in which many of the concepts that we employ _conflict_ with the very preconditions of meaning and of knowledge. ●●●●● This is a book about the boundaries of frameworks and about the unrecognized conceptual confusions in which we become entangled when we attempt to transgress beyond the limits of the possible and meaningful. We tend either not to recognize or not to accept that we all-too-often attempt to trespass beyond the boundaries of the frameworks that make knowledge possible and the world meaningful. ●●●●● The _Critique of Impure Reason_ proposes a bold, ground-breaking, and startling thesis: that a great many of the major philosophical problems of the past can be solved through the recognition of a viciously deceptive form of thinking to which philosophers as well as non-philosophers commonly fall victim. For the first time, the book advances and justifies the criticism that a substantial number of the questions that have occupied philosophers fall into the category of “impure reason,” violating the very conditions of their possible meaningfulness. ●●●●● The purpose of the study is twofold: first, to enable us to recognize the boundaries of what is referentially forbidden—the limits beyond which reference becomes meaningless—and second, to avoid falling victims to a certain broad class of conceptual confusions that lie at the heart of many major philosophical problems. As a consequence, the boundaries of _possible meaning_ are determined. ●●●●● Bartlett, the author or editor of more than 20 books, is responsible for identifying this widespread and delusion-inducing variety of error, _metalogical projection_. It is a previously unrecognized and insidious form of erroneous thinking that undermines its own possibility of meaning. It comes about as a result of the pervasive human compulsion to seek to transcend the limits of possible reference and meaning. ●●●●● Based on original research and rigorous analysis combined with extensive scholarship, the _Critique of Impure Reason_ develops a self-validating method that makes it possible to recognize, correct, and eliminate this major and pervasive form of fallacious thinking. In so doing, the book provides at last provable and constructive solutions to a wide range of major philosophical problems. ●●●●● CONTENTS AT A GLANCE ▪▪▪▪▪ Preface ▪▪▪▪▪ Foreword by Carl Friedrich von Weizsäcker ▪▪▪▪▪ Acknowledgments ▪▪▪▪▪ Avant-propos: A philosopher’s rallying call ▪▪▪▪▪ Introduction ▪▪▪▪▪ A note to the reader ▪▪▪▪▪ A note on conventions ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART I ▪▪▪▪▪ ▪▪▪▪▪ WHY PHILOSOPHY HAS MADE NO PROGRESS AND HOW IT CAN ▪▪▪▪▪ 1 Philosophical-psychological prelude ▪▪▪▪▪ 2 Putting belief in its place: Its psychology and a needed polemic ▪▪▪▪▪ 3 Turning away from the linguistic turn: From theory of reference to metalogic of reference ▪▪▪▪▪ 4 The stepladder to maximum theoretical generality ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART II ▪▪▪▪▪ THE METALOGIC OF REFERENCE ▪▪▪▪▪ A New Approach to Deductive, Transcendental Philosophy ▪▪▪▪▪ 5 Reference, identity, and identification ▪▪▪▪▪ 6 Self-referential argument and the metalogic of reference ▪▪▪▪▪ 7 Possibility theory ▪▪▪▪▪ 8 Presupposition logic, reference, and identification ▪▪▪▪▪ 9 Transcendental argumentation and the metalogic of reference ▪▪▪▪▪ 10 Framework relativity ▪▪▪▪▪ 11 The metalogic of meaning ▪▪▪▪▪ 12 The problem of putative meaning and the logic of meaninglessness ▪▪▪▪▪ 13 Projection ▪▪▪▪▪ 14 Horizons ▪▪▪▪▪ 15 De-projection ▪▪▪▪▪ 16 Self-validation ▪▪▪▪▪ 17 Rationality: Rules of admissibility ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART III ▪▪▪▪▪ PHILOSOPHICAL APPLICATIONS OF THE METALOGIC OF REFERENCE ▪▪▪▪▪ Major Problems and Questions of Philosophy and the Philosophy of Science ▪▪▪▪▪ 18 Ontology and the metalogic of reference ▪▪▪▪▪ 19 Discovery or invention in general problem-solving, mathematics, and physics ▪▪▪▪▪ 20 The conceptually unreachable: “The far side” ▪▪▪▪▪ 21 The projections of the external world, things-in-themselves, other minds, realism, and idealism ▪▪▪▪▪ 22 The projections of time, space, and space-time ▪▪▪▪▪ 23 The projections of causality, determinism, and free will ▪▪▪▪▪ 24 Projections of the self and of solipsism ▪▪▪▪▪ 25 Non-relational, agentless reference and referential fields ▪▪▪▪▪ 26 Relativity physics as seen through the lens of the metalogic of reference ▪▪▪▪▪ 27 Quantum theory as seen through the lens of the metalogic of reference ▪▪▪▪▪ 28 Epistemological lessons learned from and applicable to relativity physics and quantum theory ▪▪▪▪▪ ▪▪▪▪▪ PART IV ▪▪▪▪▪ HORIZONS ▪▪▪▪▪ 29 Beyond belief ▪▪▪▪▪ 30 _Critique of Impure Reason_: Its results in retrospect ▪▪▪▪▪ ▪▪▪▪▪ SUPPLEMENT ▪▪▪▪▪ The Formal Structure of the Metalogic of Reference ▪▪▪▪▪ APPENDIX I ▪▪▪▪▪ The Concept of Horizon in the Work of Other Philosophers ▪▪▪▪▪ APPENDIX II ▪▪▪▪▪ Epistemological Intelligence ▪▪▪▪▪ References ▪▪▪▪▪ Index ▪▪▪▪▪ About the author. (shrink)

The book provides a historical and systematic exposition of the semantic theory of truth formulated by Alfred Tarski in the 1930s. This theory became famous very soon and inspired logicians and philosophers. It has two different, but interconnected aspects: formal-logical and philosophical. The book deals with both, but it is intended mostly as a philosophical monograph. It explains Tarski’s motivation and presents discussions about his ideas as well as points out various applications of the semantic theory of truth to philosophical (...) problems. (shrink)

According to the implicit commitment thesis, once accepting a mathematical formal system S, one is implicitly committed to additional resources not immediately available in S. Traditionally, this thesis has been understood as entailing that, in accepting S, we are bound to accept reflection principles for S and therefore claims in the language of S that are not derivable in S itself. It has recently become clear, however, that such reading of the implicit commitment thesis cannot be compatible with well-established positions (...) in the foundations of mathematics which consider a specific theory S as self-justifying and doubt the legitimacy of any principle that is not derivable in S: examples are Tait’s finitism and the role played in it by Primitive Recursive Arithmetic, Isaacson’s thesis and Peano Arithmetic, Nelson’s ultrafinitism and sub-exponential arithmetical systems. This casts doubts on the very adequacy of the implicit commitment thesis for arithmetical theories. In the paper we show that such foundational standpoints are nonetheless compatible with the implicit commitment thesis. We also show that they can even be compatible with genuine soundness extensions of S with suitable form of reflection. The analysis we propose is as follows: when accepting a system S, we are bound to accept a fixed set of principles extending S and expressing minimal soundness requirements for S, such as the fact that the non-logical axioms of S are true. We call this invariant component the semantic core of implicit commitment. But there is also a variable component of implicit commitment that crucially depends on the justification given for our acceptance of S in which, for instance, may or may not appear reflection principles for S. We claim that the proposed framework regulates in a natural and uniform way our acceptance of different arithmetical theories. (shrink)

We discuss the principles for a primitive, object-linguistic notion of consequence proposed by ) that yield a version of Curry’s paradox. We propose and study several strategies to weaken these principles and overcome paradox: all these strategies are based on the intuition that the object-linguistic consequence predicate internalizes whichever meta-linguistic notion of consequence we accept in the first place. To these solutions will correspond different conceptions of consequence. In one possible reading of these principles, they give rise to a notion (...) of logical consequence: we study the corresponding theory of validity by showing that it is conservative over a wide range of base theories: this result is achieved via a well-behaved form of local reduction. The theory of logical consequence is based on a restriction of the introduction rule for the consequence predicate. To unrestrictedly maintain this principle, we develop a conception of object-linguistic consequence, which we call grounded consequence, that displays a restriction of the structural rule of reflexivity. This construction is obtained by generalizing Saul Kripke’s inductive theory of truth. Grounded validity will be shown to satisfy several desirable principles for a naïve, self-applicable notion of consequence. (shrink)

This paper explores the relationship between Hume's Prinicple and Basic Law V, investigating the question whether we really do need to suppose that, already in Die Grundlagen, Frege intended that HP should be justified by its derivation from Law V.

A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Gödel's incompleteness theorems, conservation results, independence results, ordinal analysis, predicativity, reverse mathematics, speed-up results, and provability logics.

I had the pleasure of renewing my acquaintance with Per Lindström at the meeting of the Seventh Scandinavian Logic Symposium, held in Uppsala in August 1996. There at lunch one day, Per said he had long been curious about the development of some of the ideas in my paper [1960] on the arithmetization of metamathematics. In particular, I had used the construction of a non-standard definition !* of the set of axioms of P (Peano Arithmetic) to show that P + (...) {¬ Con!} is interpretable in P, where ! is a standard definition of the axioms of P and Con! expresses the consistency of P via that presentation. Per pointed out that there is a simple “two-line” proof of this interpretability result which does not require the use of such formulas as !*, and he wondered whether I had been aware of that. In fact, his proof had never occurred to me, and if it had at the time, it is possible I would never have been led to the use of non-natural definitions. Per regarded this as a happy accident, since subsequent work by him and others on interpretability made essential use of such definitions. In our conversation, I enlarged a bit on the background to my work on arithmetization, and when I was invited to contribute to this special issue of Theoria dedicated to Lindström, it seemed a natural choice to use the occasion to fill out the story. One caveat, though: the following is drawn largely from memory, not always reliable, supplemented by consultation of the 1960 paper and the 1957 dissertation from which it was drawn. (shrink)

The implicit commitment thesis is the claim that believing in a mathematical theory S carries an implicit commitment to further sentences not deductively entailed by the theory, such as the consistency sentence Con(S). I provide a new argument for this thesis based on the notion of mathematical certainty. I also reply to a recent argument by Walter Dean against the implicit commitment thesis, showing that my formulation of the thesis avoids the difficulties he raises.

In his previous work, the author has introduced the axiom schema of inductive dichotomy, a weak variant of the axiom schema of inductive definition, and used this schema for elementary ) positive operators to separate open and clopen determinacies for those games in which two players make choices from infinitely many alternatives in various circumstances. Among the studies on variants of inductive definitions for bounded ) positive operators, the present article investigates inductive dichotomy for these operators, and applies it to (...) constructive investigations of variants of determinacy statements for those games in which the players make choices from only finitely many alternatives. As a result, three formulations of open determinacy, that are all classically equivalent with each other, are equivalent to three different semi-classical principles, namely Markov’s Principle, Lesser Limited Principle of Omniscience and Limited Principle of Omniscience, over a suitable constructive base theory that proves clopen determinacy. Open and clopen determinacies for these games are thus separated. Some basic results on variants of inductive definitions for \ positive operators will also be given. (shrink)

We prove that the statement “there is aksuch that for everyfthere is ak-bounded diagonally nonrecursive function relative tof” does not imply weak König’s lemma over${\rm{RC}}{{\rm{A}}_0} + {\rm{B\Sigma }}_2^0$. This answers a question posed by Simpson. A recursion-theoretic consequence is that the classic fact that everyk-bounded diagonally nonrecursive function computes a 2-bounded diagonally nonrecursive function may fail in the absence of${\rm{I\Sigma }}_2^0$.

In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...) of our PIF account of truth-talk, we demonstrate a few advantages it offers over T-deflationist accounts that do not explicitly acknowledge pretense at work in the discourse. In turning to the Liar Paradox, we explain how the quasi-anaphoric functioning that our account attributes to truth-talk provides a diagnosis of the Liar Paradox (and other instances of semantic pathology) as having no content—in the sense of not specifying any of what we call M-conditions. At the same time, however, we vindicate the intuition that we can understand liar sentences, thereby avoiding one standard objection to “meaningless strategy” responses to the Liar Paradox. With this diagnosis in place, we then, by way of treatment, introduce a new predicate, ‘semantically defective’, and show how the explanation we give for its application allows for a consistent, yet revenge-immune, (dis)solution of the Liar Paradox, and semantic pathology generally. (shrink)

In the paper we investigate typed axiomatizations of the truth predicate in which the axioms of truth come with a built-in, minimal and self-sufficient machinery to talk about syntactic aspects of an arbitrary base theory. Expanding previous works of the author and building on recent works of Albert Visser and Richard Heck, we give a precise characterization of these systems by investigating the strict relationships occurring between them, arithmetized model constructions in weak arithmetical systems and suitable set existence axioms. The (...) framework considered will give rise to some methodological remarks on the construction of truth theories and provide us with a privileged point of view to analyze the notion of truth arising from compositional principles in a typed setting. (shrink)

In this paper, we investigate the phenomenon ofspeed-upin the context of theories of truth. We focus on axiomatic theories of truth extending Peano arithmetic. We are particularly interested on whether conservative extensions of PA have speed-up and on how this relates to a deflationist account. We show that disquotational theories have no significant speed-up, in contrast to some compositional theories, and we briefly assess the philosophical implications of these results.

We show the non-arithmeticity of 1st order theories of lattices of Σ n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithmetic theories than has been previously known, and of the lattice of degrees of interpretability over PA. The first two results are applications of Nies’ theorem on the non-arithmeticity of the 1st order theory of the lattice of r.e. ideals on any effectively dense r.e. Boolean algebra. The theorem on degrees of (...) interpretability relies on an adaptation of techniques leading to Nies’ theorem. (shrink)

In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like CPV and PV1. We use the mentioned results to obtain some independence results in the context of intuitionistic bounded arithmetic. We show that, if the intuitionistic theory of polynomial induction (...) on strict $\Pi_2^{b}$ formulas proves decidability of $\Sigma_1^b$ formulas, then P=NP. We also prove that, if the mentioned intuitionistic theory proves ${\rm LMIN}(\Sigma_{1}^{b})$ , then P=NP. (shrink)

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)

In this paper we formulate a version of Second Incompleteness Theorem. The idea is that a sequential sentence has ‘consistency power’ over a theory if it enables us to construct a bounded interpretation of that theory. An interpretation of V in U is bounded if, for some n , all translations of V -sentences are U -provably equivalent to sentences of complexity less than n . We call a sequential sentence with consistency power over T a pro-consistency statement for T (...) . We study pro-consistency statements. We provide an example of a pro-consistency statement for a sequential sentence A that is weaker than an ordinary consistency statement for A . We show that, if A is $${{\sf S}^{1}_{2}}$$ , this sentence has some further appealing properties, specifically that it is an Orey sentence for EA . The basic ideas of the paper essentially involve sequential theories. We have a brief look at the wider environment of the results, to wit the case of theories with pairing. (shrink)

This paper is an investigation into what could be a goodexplication of ``theory S is reducible to theory T''''. Ipresent an axiomatic approach to reducibility, which is developedmetamathematically and used to evaluate most of the definitionsof ``reducible'''' found in the relevant literature. Among these,relative interpretability turns out to be most convincing as ageneral reducibility concept, proof-theoreticalreducibility being its only serious competitor left. Thisrelation is analyzed in some detail, both from the point of viewof the reducibility axioms and of modal logic.

From proofs in any classical first-order theory that proves the existence of at least two elements, one can eliminate definitions in polynomial time. From proofs in any classical first-order theory strong enough to code finite functions, including sequential theories, one can also eliminate Skolem functions in polynomial time.

This article is about Avicenna’s account of syllogisms comprising opposite premises. We examine the applications and the truth conditions of these syllogisms. Finally, we discuss the relation between these syllogisms and the principle of non-contradiction.

This is a paper for a special issue of Semiotic Studies devoted to Stanislaw Krajewski’s paper. This paper gives some supplementary notes to Krajewski’s on the Anti-Mechanist Arguments based on Gödel’s incompleteness theorem. In Section 3, we give some additional explanations to Section 4–6 in Krajewski’s and classify some misunderstandings of Gödel’s incompleteness theorem related to AntiMechanist Arguments. In Section 4 and 5, we give a more detailed discussion of Gödel’s Disjunctive Thesis, Gödel’s Undemonstrability of Consistency Thesis and the definability (...) of natural numbers as in Section 7–8 in Krajewski’s, describing how recent advances bear on these issues. (shrink)

We study variants of Buss’s theories of bounded arithmetic axiomatized by induction schemes disallowing the use of parameters, and closely related induction inference rules. We put particular emphasis on \ induction schemes, which were so far neglected in the literature. We present inclusions and conservation results between the systems and \ of a new form), results on numbers of instances of the axioms or rules, connections to reflection principles for quantified propositional calculi, and separations between the systems.

It can be argued that only the equational theories of some sub-elementary function algebras are finitistic or intuitive according to a certain interpretation of Hilbert's conception of intuition. The purpose of this paper is to investigate the relation of those restricted forms of equational reasoning to classical quantifier logic in arithmetic. The conclusion reached is that Edward Nelson's ‘predicative arithmetic’ program, which makes essential use of classical quantifier logic, cannot be justified finitistically and thus requires a different philosophical foundation, possibly (...) as a restricted form of logicism. (shrink)

Solovay proved (Israel J Math 25(3–4):287–304, 1976) that the propositional provability logic of any ∑2-sound recursively enumerable extension of PA is characterized by the propositional modal logic GL. By contrast, Montagna proved in (Notre Dame J Form Log 25(2):179–189, 1984) that predicate provability logics of Peano arithmetic and Bernays–Gödel set theory are different. Moreover, Artemov proved in (Doklady Akademii Nauk SSSR 290(6):1289–1292, 1986) that the predicate provability logic of a theory essentially depends on the choice of a binumeration of the (...) theory which is used to construct the provability predicate. In this paper, we compare predicate provability logics of I∑ n ’s. For a binumeration α(x) of a recursive theory T, let PL α(T) be the predicate provability logic of T defined by α(x). We prove that for any natural numbers i, j such that 0 < i < j, there exists a ∑1 binumeration α(x) of some recursive axiomatization of I∑ i such that ${{\sf PL}_\alpha({\rm I \Sigma}_i) \nsupseteq \bigcap_{\beta(x)}{\sf PL}_\beta({\rm I \Sigma}_j)}$ and ${{\sf PL}_\alpha({\rm I \Sigma}_i) \nsubseteq \bigcup_{\beta(x)}{\sf PL}_\beta({\rm I \Sigma}_j)}$ , where β(x) ranges over all ∑1 binumerations of recursive axiomatizations of I∑ j. (shrink)

We investigate what happens when ‘truth’ is replaced with ‘provability’ in Yablo’s paradox. By diagonalization, appropriate sequences of sentences can be constructed. Such sequences contain no sentence decided by the background consistent and sufficiently strong arithmetical theory. If the provability predicate satisfies the derivability conditions, each such sentence is provably equivalent to the consistency statement and to the Gödel sentence. Thus each two such sentences are provably equivalent to each other. The same holds for the arithmetization of the existential Yablo (...) paradox. We also look at a formulation which employs Rosser’s provability predicate. (shrink)

In this article, I examine the ramified-type theory set out in the first edition of Russell and Whitehead's Principia Mathematica. My starting point is the ‘no loss of generality’ problem: Russell, in the Introduction (Russell, B. and Whitehead, A. N. 1910. Principia Mathematica, Volume I, 1st ed., Cambridge: Cambridge University Press, pp. 53–54), says that one can account for all propositional functions using predicative variables only, that is, dismissing non-predicative variables. That claim is not self-evident at all, hence a problem. (...) The purpose of this article is to clarify Russell's claim and to solve the ‘no loss of generality’ problem. I first remark that the hierarchy of propositional functions calls for a fine-grained conception of ramified types as propositional forms (‘ramif-types’). Then, comparing different important interpretations of Principia’s theory of types, I consider the question as to whether Principia allows for non-predicative propositional functions and variables thereof. I explain how the distinction between the formal system of the theory, on the one hand, and its realizations in different epistemic universes, on the other hand, makes it possible to give us a more satisfactory answer to that question than those given by previous commentators, and, as a consequence, to solve the ‘no loss of generality’ problem. The solution consists in a substitutional semantics for non-predicative variables and non-predicative complex terms, based on an epistemic understanding of the order component of ramified types. The rest of the article then develops that epistemic understanding, adding an original epistemic model theory to the formal system of types. This shows that the universality sought by Russell for logic does not preclude semantical considerations, contrary to what van Heijenoort and Hintikka have claimed. (shrink)