Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Interpretability in Robinson's Q.Fernando Ferreira & Gilda Ferreira - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
    Edward Nelson published in 1986 a book defending an extreme formalist view of mathematics according to which there is an impassable barrier in the totality of exponentiation. On the positive side, Nelson embarks on a program of investigating how much mathematics can be interpreted in Raphael Robinson's theory of arithmetic Q. In the shadow of this program, some very nice logical investigations and results were produced by a number of people, not only regarding what can be interpreted in Q but (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (2 other versions)On Epistemic Entitlement.Crispin Wright & Martin Davies - 2004 - Aristotelian Society Supplementary Volume 78:167-245.
    [Crispin Wright] Two kinds of epistemological sceptical paradox are reviewed and a shared assumption, that warrant to accept a proposition has to be the same thing as having evidence for its truth, is noted. 'Entitlement', as used here, denotes a kind of rational warrant that counter-exemplifies that identification. The paper pursues the thought that there are various kinds of entitlement and explores the possibility that the sceptical paradoxes might receive a uniform solution if entitlement can be made to reach sufficiently (...)
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • (4 other versions)What is Cantor's Continuum Problem?Kurt Gödel - 1947 - The American Mathematical Monthly 54 (9):515--525.
    Download  
     
    Export citation  
     
    Bookmark   220 citations  
  • Truth, Conservativeness, and Provability.Cezary Cieśliński - 2010 - Mind 119 (474):409-422.
    Conservativeness has been proposed as an important requirement for deflationary truth theories. This in turn gave rise to the so-called ‘conservativeness argument’ against deflationism: a theory of truth which is conservative over its base theory S cannot be adequate, because it cannot prove that all theorems of S are true. In this paper we show that the problems confronting the deflationist are in fact more basic: even the observation that logic is true is beyond his reach. This seems to conflict (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Intuition, entitlement and the epistemology of logical laws.Crispin Wright - 2004 - Dialectica 58 (1):155–175.
    The essay addresses the well‐known idea that there has to be a place for intuition, thought of as a kind of non‐inferential rational insight, in the epistemology of basic logic if our knowledge of its principles is non‐empirical and is to allow of any finite, non‐circular reconstruction. It is argued that the error in this idea consists in its overlooking the possibility that there is, properly speaking, no knowledge of the validity of principles of basic logic. When certain important distinctions (...)
    Download  
     
    Export citation  
     
    Bookmark   56 citations  
  • (2 other versions)Warrant for nothing (and foundations for free)?Crispin Wright - 2004 - Aristotelian Society Supplementary Volume 78 (1):167–212.
    Download  
     
    Export citation  
     
    Bookmark   500 citations  
  • Some reflections on the acquisition of warrant by inference.C. Wright - 2003 - In Susana Nuccetelli (ed.), New Essays on Semantic Externalism and Self-Knowledge. MIT Press. pp. 57--78.
    Download  
     
    Export citation  
     
    Bookmark   116 citations  
  • Mathematical Thought and its Objects.Charles Parsons - 2007 - New York: Cambridge University Press.
    Charles Parsons examines the notion of object, with the aim to navigate between nominalism, denying that distinctively mathematical objects exist, and forms of Platonism that postulate a transcendent realm of such objects. He introduces the central mathematical notion of structure and defends a version of the structuralist view of mathematical objects, according to which their existence is relative to a structure and they have no more of a 'nature' than that confers on them. Parsons also analyzes the concept of intuition (...)
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • Reflection algebras and conservation results for theories of iterated truth.Lev D. Beklemishev & Fedor N. Pakhomov - 2022 - Annals of Pure and Applied Logic 173 (5):103093.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)What is Epistemic Entitlement? Reliable Competence, Reasons, Inference, Access.Peter Graham - 2020 - In Christoph Kelp & John Greco (eds.), Virtue Theoretic Epistemology: New Methods and Approaches. New York, NY: Cambridge University Press. pp. 93-123.
    Tyler Burge first introduced his distinction between epistemic entitlement and epistemic justification in ‘Content Preservation’ in 1993. He has since deployed the distinction in over twenty papers, changing his formulation around 2009. His distinction and its basis, however, is not well understood in the literature. This chapter distinguishes two uses of ‘entitlement’ in Burge, and then focuses on his distinction between justification and entitlement, two forms of warrant, where warrants consists in the exercise of a reliable belief-forming competence. Since he (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Scientific Image.William Demopoulos & Bas C. van Fraassen - 1982 - Philosophical Review 91 (4):603.
    Download  
     
    Export citation  
     
    Bookmark   1794 citations  
  • Predicative arithmetic.Edward Nelson - 1986 - Princeton, N.J.: Princeton University Press.
    This book develops arithmetic without the induction principle, working in theories that are interpretable in Raphael Robinson's theory Q. Certain inductive formulas, the bounded ones, are interpretable in Q. A mathematically strong, but logically very weak, predicative arithmetic is constructed. Originally published in 1986. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original texts of these important books while presenting (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.
    Download  
     
    Export citation  
     
    Bookmark   117 citations  
  • Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
    Download  
     
    Export citation  
     
    Bookmark   107 citations  
  • Another Look at Reflection.Martin Fischer - 2021 - Erkenntnis 88 (2):479-509.
    Reflection principles are of central interest in the development of axiomatic theories. Whereas they are independent statements they appear to have a specific epistemological status. Our trust in those principles is as warranted as our trust in the axioms of the system itself. This paper is an attempt in clarifying this special epistemic status. We provide a motivation for the adoption of uniform reflection principles by their analogy to a form of the constructive \(\omega \) -rule. Additionally, we analyse the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Stable and Unstable Theories of Truth and Syntax.Beau Madison Mount & Daniel Waxman - 2021 - Mind 130 (518):439-473.
    Recent work on formal theories of truth has revived an approach, due originally to Tarski, on which syntax and truth theories are sharply distinguished—‘disentangled’—from mathematical base theories. In this paper, we defend a novel philosophical constraint on disentangled theories. We argue that these theories must be epistemically stable: they must possess an intrinsic motivation justifying no strictly stronger theory. In a disentangled setting, even if the base and the syntax theory are individually stable, they may be jointly unstable. We contend (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Implicit Commitment of Arithmetical Theories and Its Semantic Core.Carlo Nicolai & Mario Piazza - 2019 - Erkenntnis 84 (4):913-937.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Axiomatic truth, syntax and metatheoretic reasoning.Graham E. Leigh & Carlo Nicolai - 2013 - Review of Symbolic Logic 6 (4):613-636.
    Following recent developments in the literature on axiomatic theories of truth, we investigate an alternative to the widespread habit of formalizing the syntax of the object-language into the object-language itself. We first argue for the proposed revision, elaborating philosophical evidences in favor of it. Secondly, we present a general framework for axiomatic theories of truth with theories of syntax. Different choices of the object theory O will be considered. Moreover, some strengthenings of these theories will be introduced: we will consider (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Two kinds of ontological commitment.Howard Peacock - 2011 - Philosophical Quarterly 61 (242):79-104.
    There are two different ways of understanding the notion of ‘ontological commitment ’. A question about ‘what is said to be’ by a theory or ‘what a theory says there is’ deals with ‘explicit’ commitment ; a question about the ontological costs or preconditions of the truth of a theory concerns ‘implicit’ commitment. I defend a conception of ontological commitment as implicit commitment, and argue that existentially quantified idioms in natural language are implicitly, but not explicitly, committing. I use the (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Inexhaustibility: A Non-Exhaustive Treatment.Torkel Franzén - 2003 - Association for Symbolic Logic.
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the sixteenth publication in the Lecture Notes in Logic series, gives a sustained presentation of a particular view of the topic of Gödelian extensions of theories. It presents the basic material in predicate logic, set theory and recursion (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • (4 other versions)What is Cantor's Continuum Problem?Kurt Gödel - 1983 - In Paul Benacerraf & Hilary Putnam (eds.), Philosophy of Mathematics: Selected Readings (2nd Edition). Cambridge University Press. pp. 470-485.
    Download  
     
    Export citation  
     
    Bookmark   137 citations  
  • Implicit commitment in theory choice.Stephan Krämer - unknown
    The proper evaluation of a theory's virtues seems to require taking into account what the theory is indirectly or implicitly committed to, in addition to what it explicitly says. Most extant proposals for criteria of theory choice in the literature spell out the relevant notion of implicit commitment via some notion of entailment. I show that such criteria behave implausibly in application to theories that differ over matters of entailment. A recent defence by Howard Peacock of such a criterion against (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Metamathematics of First-Order Arithmetic.Petr Hajék & Pavel Pudlák - 1994 - Studia Logica 53 (3):465-466.
    Download  
     
    Export citation  
     
    Bookmark   143 citations  
  • (2 other versions)On Epistemic Entitlement.Crispin Wright & Martin Davies - 2004 - Aristotelian Society Supplementary Volume 78:167-245.
    [Crispin Wright] Two kinds of epistemological sceptical paradox are reviewed and a shared assumption, that warrant to accept a proposition has to be the same thing as having evidence for its truth, is noted. 'Entitlement', as used here, denotes a kind of rational warrant that counter-exemplifies that identification. The paper pursues the thought that there are various kinds of entitlement and explores the possibility that the sceptical paradoxes might receive a uniform solution if entitlement can be made to reach sufficiently (...)
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • (1 other version)Proof and Truth.Stewart Shapiro - 1998 - Journal of Philosophy 95 (10):493-521.
    Download  
     
    Export citation  
     
    Bookmark   88 citations  
  • Conceptual structuralism and the continuum.Solomon Feferman - unknown
    • This comes from my general view of the nature of mathematics, that it is humanly based and that it deals with more or less clear conceptions of mathematical structures; for want of a better word, I call that view conceptual structuralism.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Disquotational truth and analyticity.Volker Halbach - 2001 - Journal of Symbolic Logic 66 (4):1959-1973.
    The uniform reflection principle for the theory of uniform T-sentences is added to PA. The resulting system is justified on the basis of a disquotationalist theory of truth where the provability predicate is conceived as a special kind of analyticity. The system is equivalent to the system ACA of arithmetical comprehension. If the truth predicate is also allowed to occur in the sentences that are inserted in the T-sentences, yet not in the scope of negation, the system with the reflection (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • On Reflection.Leon Horsten - 2021 - Philosophical Quarterly 71 (4):pqaa083.
    This article gives an epistemological analysis of the reflection process by means of which you can come to know the consistency of a mathematical theory that you already accept. It is argued that this process can result in warranted belief in new mathematical principles without justifying them.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)Hypatia's silence.Martin Fischer, Leon Horsten & Carlo Nicolai - 2021 - Noûs 55 (1):62-85.
    Hartry Field distinguished two concepts of type‐free truth: scientific truth and disquotational truth. We argue that scientific type‐free truth cannot do justificatory work in the foundations of mathematics. We also present an argument, based on Crispin Wright's theory of cognitive projects and entitlement, that disquotational truth can do justificatory work in the foundations of mathematics. The price to pay for this is that the concept of disquotational truth requires non‐classical logical treatment.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Our Entitlement to Self-Knowledge.Tyler Burge & Christopher Peacocke - 1996 - Proceedings of the Aristotelian Society 96 (1):91-116.
    Tyler Burge, Christopher Peacocke; Our Entitlement to Self-Knowledge, Proceedings of the Aristotelian Society, Volume 96, Issue 1, 1 June 1996, Pages 91–116, ht.
    Download  
     
    Export citation  
     
    Bookmark   182 citations  
  • New Constructions of Satisfaction Classes.Albert Visser & Ali Enayat - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Arithmetical Reflection and the Provability of Soundness.Walter Dean - 2015 - Philosophia Mathematica 23 (1):31-64.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Defending the Axioms: On the Philosophical Foundations of Set Theory.Penelope Maddy - 2011 - Oxford, England: Oxford University Press.
    Mathematics depends on proofs, and proofs must begin somewhere, from some fundamental assumptions. For nearly a century, the axioms of set theory have played this role, so the question of how these axioms are properly judged takes on a central importance. Approaching the question from a broadly naturalistic or second-philosophical point of view, Defending the Axioms isolates the appropriate methods for such evaluations and investigates the ontological and epistemological backdrop that makes them appropriate. In the end, a new account of (...)
    Download  
     
    Export citation  
     
    Bookmark   46 citations  
  • Systems of logic based on ordinals..Alan Turing - 1939 - London,: Printed by C.F. Hodgson & son.
    Download  
     
    Export citation  
     
    Bookmark   101 citations  
  • Truth is Simple.Leon Horsten & Graham E. Leigh - 2016 - Mind:fzv184.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Transfinite Recursive Progressions of Axiomatic Theories.Solomon Feferman - 1967 - Journal of Symbolic Logic 32 (4):530-531.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Truth is Simple.Leon Horsten & Graham E. Leigh - 2017 - Mind 126 (501):195-232.
    Even though disquotationalism is not correct as it is usually formulated, a deep insight lies behind it. Specifically, it can be argued that, modulo implicit commitment to reflection principles, all there is to the notion of truth is given by a simple, natural collection of truth-biconditionals.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Conservativity for theories of compositional truth via cut elimination.Graham E. Leigh - 2015 - Journal of Symbolic Logic 80 (3):845-865.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.K. Gödel - 1931 - Monatshefte für Mathematik 38 (1):173--198.
    Download  
     
    Export citation  
     
    Bookmark   250 citations  
  • On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
    In 'On interpretations of arithmetic and set theory', Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic.

    THEOREM 1 The first-order theories of Peano arithmetic and Zermelo-Fraenkel set theory with the axiom of infinity negated are bi-interpretable.

    In this note, I describe a theory of sets that is bi-interpretable with the theory of bounded arithmetic IDelta0 + exp. Because of the weakness of this theory of sets, I cannot straightforwardly adapt Kaye and Wong's (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Deflationism and the gödel phenomena: Reply to Tennant.Jeffrey Ketland - 2005 - Mind 114 (453):75-88.
    Any (1-)consistent and sufficiently strong system of first-order formal arithmetic fails to decide some independent Gödel sentence. We examine consistent first-order extensions of such systems. Our purpose is to discover what is minimally required by way of such extension in order to be able to prove the Gödel sentence in a nontrivial fashion. The extended methods of formal proof must capture the essentials of the so-called 'semantical argument' for the truth of the Gödel sentence. We are concerned to show that (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • (1 other version)Proof and Truth.Stewart Shapiro - 1998 - Journal of Philosophy 95 (10):493-521.
    Download  
     
    Export citation  
     
    Bookmark   67 citations  
  • What rests on what? The proof-theoretic analysis of mathematics.Solomon Feferman - 1993 - In J. Czermak (ed.), Philosophy of Mathematics. Hölder-Pichler-Tempsky. pp. 1--147.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Minimalism and the generalisation problem: on Horwich’s second solution.Cezary Cieśliński - 2018 - Synthese 195 (3):1077-1101.
    Disquotational theories of truth are often criticised for being too weak to prove interesting generalisations about truth. In this paper we will propose a certain formal theory to serve as a framework for a solution of the generalisation problem. In contrast with Horwich’s original proposal, our framework will eschew psychological notions altogether, replacing them with the epistemic notion of believability. The aim will be to explain why someone who accepts a given disquotational truth theory Th, should also accept various generalisations (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Epistemic Lightness of Truth: Deflationism and its Logic.Cezary Cieśliński - 2017 - Cambridge, United Kingdom: Cambridge University Press.
    This book analyses and defends the deflationist claim that there is nothing deep about our notion of truth. According to this view, truth is a 'light' and innocent concept, devoid of any essence which could be revealed by scientific inquiry. Cezary Cieśliński considers this claim in light of recent formal results on axiomatic truth theories, which are crucial for understanding and evaluating the philosophical thesis of the innocence of truth. Providing an up-to-date discussion and original perspectives on this central and (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • (1 other version)Interpretability in Robinson's Q.Fernando Ferreira & Gilda Ferreira - 2013 - Bulletin of Symbolic Logic 19 (3):289-317.
    Edward Nelson published in 1986 a book defending an extreme formalist view of mathematics according to which there is animpassable barrierin the totality of exponentiation. On the positive side, Nelson embarks on a program of investigating how much mathematics can be interpreted in Raphael Robinson's theory of arithmetic. In the shadow of this program, some very nice logical investigations and results were produced by a number of people, not only regarding what can be interpreted inbut also what cannot be so (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Construction of Satisfaction Classes for Nonstandard Models.Henryk Kotlarski, Stanislav Krajewski & Alistair H. Lachlan - 1981 - Canadian Mathematical Bulletin 24 (1):283--93.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Metamathematics of First-Order Arithmetic.P. Hájek & P. Pudlák - 2000 - Studia Logica 64 (3):429-430.
    Download  
     
    Export citation  
     
    Bookmark   81 citations  
  • Predicative Arithmetic.Edward Nelson - 1986 - Studia Logica 48 (1):129-130.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Bounded Induction and Satisfaction Classes.Henryk Kotlarski - 1986 - Mathematical Logic Quarterly 32 (31-34):531-544.
    Download  
     
    Export citation  
     
    Bookmark   29 citations