Switch to: Citations

Add references

You must login to add references.
  1. Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
    Download  
     
    Export citation  
     
    Bookmark   234 citations  
  • Philosophy and Model Theory.Tim Button & Sean P. Walsh - 2018 - Oxford, UK: Oxford University Press. Edited by Sean Walsh & Wilfrid Hodges.
    Philosophy and model theory frequently meet one another. Philosophy and Model Theory aims to understand their interactions -/- Model theory is used in every ‘theoretical’ branch of analytic philosophy: in philosophy of mathematics, in philosophy of science, in philosophy of language, in philosophical logic, and in metaphysics. But these wide-ranging appeals to model theory have created a highly fragmented literature. On the one hand, many philosophically significant mathematical results are found only in mathematics textbooks: these are aimed squarely at mathematicians; (...)
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • Deflationism beyond arithmetic.Kentaro Fujimoto - 2019 - Synthese 196 (3):1045-1069.
    The conservativeness argument poses a dilemma to deflationism about truth, according to which a deflationist theory of truth must be conservative but no adequate theory of truth is conservative. The debate on the conservativeness argument has so far been framed in a specific formal setting, where theories of truth are formulated over arithmetical base theories. I will argue that the appropriate formal setting for evaluating the conservativeness argument is provided not by theories of truth over arithmetic but by those over (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Undecidable Theories.Alfred Tarski, Andrzej Mostowski & Raphael M. Robinson - 1953 - Philosophy 30 (114):278-279.
    Download  
     
    Export citation  
     
    Bookmark   115 citations  
  • Proof and Truth.Stewart Shapiro - 1998 - Journal of Philosophy 95 (10):493-521.
    Download  
     
    Export citation  
     
    Bookmark   90 citations  
  • Deflationism, Arithmetic, and the Argument from Conservativeness.Daniel Waxman - 2017 - Mind 126 (502):429-463.
    Many philosophers believe that a deflationist theory of truth must conservatively extend any base theory to which it is added. But when applied to arithmetic, it's argued, the imposition of a conservativeness requirement leads to a serious objection to deflationism: for the Gödel sentence for Peano Arithmetic is not a theorem of PA, but becomes one when PA is extended by adding plausible principles governing truth. This paper argues that no such objection succeeds. The issue turns on how we understand (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • How Innocent Is Deflationism?Volker Halbach - 2001 - Synthese 126 (1-2):167-194.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Undecidability without Arithmetization.Andrzej Grzegorczyk - 2005 - Studia Logica 79 (2):163-230.
    In the present paper the well-known Gödels – Churchs argument concerning the undecidability of logic (of the first order functional calculus) is exhibited in a way which seems to be philosophically interestingfi The natural numbers are not used. (Neither Chinese Theorem nor other specifically mathematical tricks are applied.) Only elementary logic and very simple set-theoretical constructions are put into the proof. Instead of the arithmetization I use the theory of concatenation (formalized by Alfred Tarski). This theory proves to be an (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • The Strength of Truth-Theories.Richard Heck - manuscript
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Grundlagen der Mathematik I.David Hilbert & Paul Bernays - 1968 - Springer.
    Die Leitgedanken meiner Untersuchungen über die Grundlagen der Mathematik, die ich - anknüpfend an frühere Ansätze - seit 1917 in Besprechungen mit P. BERNAYS wieder aufgenommen habe, sind von mir an verschiedenen Stellen eingehend dargelegt worden. Diesen Untersuchungen, an denen auch W. ACKERMANN beteiligt ist, haben sich seither noch verschiedene Mathematiker angeschlossen. Der hier in seinem ersten Teil vorliegende, von BERNAYS abgefaßte und noch fortzusetzende Lehrgang bezweckt eine Darstellung der Theorie nach ihren heutigen Ergebnissen. Dieser Ergebnisstand weist zugleich die Richtung (...)
    Download  
     
    Export citation  
     
    Bookmark   109 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  
  • 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  
  • Informal Rigour and Completeness Proofs.Georg Kreisel - 1967 - In Imre Lakatos (ed.), Problems in the philosophy of mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 138--157.
    Download  
     
    Export citation  
     
    Bookmark   172 citations  
  • Predicativism as a Philosophical Position.Geoffrey Hellman - 2004 - Revue Internationale de Philosophie 3:295-312.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.
    Download  
     
    Export citation  
     
    Bookmark   117 citations  
  • How we learn mathematical language.Vann McGee - 1997 - Philosophical Review 106 (1):35-68.
    Mathematical realism is the doctrine that mathematical objects really exist, that mathematical statements are either determinately true or determinately false, and that the accepted mathematical axioms are predominantly true. A realist understanding of set theory has it that when the sentences of the language of set theory are understood in their standard meaning, each sentence has a determinate truth value, so that there is a fact of the matter whether the cardinality of the continuum is א2 or whether there are (...)
    Download  
     
    Export citation  
     
    Bookmark   99 citations  
  • Disquotationalism and infinite conjunctions.Volker Halbach - 1999 - Mind 108 (429):1-22.
    According to the disquotationalist theory of truth, the Tarskian equivalences, conceived as axioms, yield all there is to say about truth. Several authors have claimed that the expression of infinite conjunctions and disjunctions is the only purpose of the disquotationalist truth predicate. The way in which infinite conjunctions can be expressed by an axiomatized truth predicate is explored and it is considered whether the disquotationalist truth predicate is adequate for this purpose.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Systems of predicative analysis.Solomon Feferman - 1964 - Journal of Symbolic Logic 29 (1):1-30.
    This paper is divided into two parts. Part I provides a resumé of the evolution of the notion of predicativity. Part II describes our own work on the subject.Part I§1. Conceptions of sets.Statements about sets lie at the heart of most modern attempts to systematize all (or, at least, all known) mathematics. Technical and philosophical discussions concerning such systematizations and the underlying conceptions have thus occupied a considerable portion of the literature on the foundations of mathematics.
    Download  
     
    Export citation  
     
    Bookmark   116 citations  
  • Reflecting on incompleteness.Solomon Feferman - 1991 - Journal of Symbolic Logic 56 (1):1-49.
    Download  
     
    Export citation  
     
    Bookmark   145 citations  
  • String theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.
    For each positive n , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense of deBouvere]. It (...)
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Reading the begriffsschrift.George Boolos - 1985 - Mind 94 (375):331-344.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • Mathematical Logic.Georg Kreisel - 1965 - In Lectures on Modern Mathematics. New York: Wiley. pp. 95-195.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik.Kurt Schütte - 1964 - Archive for Mathematical Logic 7 (1-2):45-60.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Metamathematics of First-Order Arithmetic.Petr Hajék & Pavel Pudlák - 1994 - Studia Logica 53 (3):465-466.
    Download  
     
    Export citation  
     
    Bookmark   139 citations  
  • An Introduction to Gödel's Theorems.Peter Smith - 2009 - Bulletin of Symbolic Logic 15 (2):218-222.
    Download  
     
    Export citation  
     
    Bookmark   68 citations  
  • Transfinite Recursive Progressions of Axiomatic Theories.Solomon Feferman - 1967 - Journal of Symbolic Logic 32 (4):530-531.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Ancestral arithmetic and Isaacson's Thesis.Peter Smith - 2008 - Analysis 68 (1):1-10.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Truth, Vagueness, and Paradox. An Essay on the Logic of Truth.Vann Mcgee & Giovanni Sommaruga-Rosolemos - 1993 - Critica 25 (73):83-108.
    Download  
     
    Export citation  
     
    Bookmark   45 citations  
  • Proof and Truth.Stewart Shapiro - 1998 - Journal of Philosophy 95 (10):493-521.
    Download  
     
    Export citation  
     
    Bookmark   65 citations  
  • Deflationary truth and the ontology of expressions.Carlo Nicolai - 2015 - Synthese 192 (12):4031-4055.
    The existence of a close connection between results on axiomatic truth and the analysis of truth-theoretic deflationism is nowadays widely recognized. The first attempt to make such link precise can be traced back to the so-called conservativeness argument due to Leon Horsten, Stewart Shapiro and Jeffrey Ketland: by employing standard Gödelian phenomena, they concluded that deflationism is untenable as any adequate theory of truth leads to consequences that were not achievable by the base theory alone. In the paper I highlight, (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A Note on Typed Truth and Consistency Assertions.Carlo Nicolai - 2016 - Journal of Philosophical Logic 45 (1):89-119.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Internal Categoricity in Arithmetic and Set Theory.Jouko Väänänen & Tong Wang - 2015 - Notre Dame Journal of Formal Logic 56 (1):121-134.
    We show that the categoricity of second-order Peano axioms can be proved from the comprehension axioms. We also show that the categoricity of second-order Zermelo–Fraenkel axioms, given the order type of the ordinals, can be proved from the comprehension axioms. Thus these well-known categoricity results do not need the so-called “full” second-order logic, the Henkin second-order logic is enough. We also address the question of “consistency” of these axiom systems in the second-order sense, that is, the question of existence of (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Aspects of Incompleteness.Per Lindström - 1999 - Studia Logica 63 (3):438-439.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Was Sind und was Sollen Die Zahlen?Richard Dedekind - 1888 - Cambridge University Press.
    This influential 1888 publication explained the real numbers, and their construction and properties, from first principles.
    Download  
     
    Export citation  
     
    Bookmark   183 citations  
  • The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 821 -- 865.
    Download  
     
    Export citation  
     
    Bookmark   101 citations  
  • Reverse mathematics and Peano categoricity.Stephen G. Simpson & Keita Yokoyama - 2013 - Annals of Pure and Applied Logic 164 (3):284-293.
    We investigate the reverse-mathematical status of several theorems to the effect that the natural number system is second-order categorical. One of our results is as follows. Define a system to be a triple A,i,f such that A is a set and i∈A and f:A→A. A subset X⊆A is said to be inductive if i∈X and ∀a ∈X). The system A,i,f is said to be inductive if the only inductive subset of A is A itself. Define a Peano system to be (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Truth, Vagueness, and Paradox: An Essay on the Logic of Truth.Vann McGee - 1990 - Indianapolis, IN, USA: Hackett.
    Awarded the 1988 Johnsonian Prize in Philosophy. Published with the aid of a grant from the National Endowment for the Humanities.
    Download  
     
    Export citation  
     
    Bookmark   113 citations  
  • Growing Commas. A Study of Sequentiality and Concatenation.Albert Visser - 2009 - Notre Dame Journal of Formal Logic 50 (1):61-85.
    In his paper "Undecidability without arithmetization," Andrzej Grzegorczyk introduces a theory of concatenation $\mathsf{TC}$. We show that pairing is not definable in $\mathsf{TC}$. We determine a reasonable extension of $\mathsf{TC}$ that is sequential, that is, has a good sequence coding.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • On Interpretability in the Theory of Concatenation.Vítězslav Švejdar - 2009 - Notre Dame Journal of Formal Logic 50 (1):87-95.
    We prove that a variant of Robinson arithmetic $\mathsf{Q}$ with nontotal operations is interpretable in the theory of concatenation $\mathsf{TC}$ introduced by A. Grzegorczyk. Since $\mathsf{Q}$ is known to be interpretable in that nontotal variant, our result gives a positive answer to the problem whether $\mathsf{Q}$ is interpretable in $\mathsf{TC}$. An immediate consequence is essential undecidability of $\mathsf{TC}$.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Proof-theoretic reduction as a philosopher's tool.Thomas Hofweber - 2000 - Erkenntnis 53 (1-2):127-146.
    Hilbert’s program in the philosophy of mathematics comes in two parts. One part is a technical part. To carry out this part of the program one has to prove a certain technical result. The other part of the program is a philosophical part. It is concerned with philosophical questions that are the real aim of the program. To carry out this part one, basically, has to show why the technical part answers the philosophical questions one wanted to have answered. Hilbert (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Concatenation as a basis for arithmetic.W. V. Quine - 1946 - Journal of Symbolic Logic 11 (4):105-114.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Deflationism and Tarski’s Paradise.Jeffrey Ketland - 1999 - Mind 108 (429):69-94.
    Deflationsism about truth is a pot-pourri, variously claiming that truth is redundant, or is constituted by the totality of 'T-sentences', or is a purely logical device (required solely for disquotational purposes or for re-expressing finitarily infinite conjunctions and/or disjunctions). In 1980, Hartry Field proposed what might be called a 'deflationary theory of mathematics', in which it is alleged that all uses of mathematics within science are dispensable. Field's criterion for the dispensability of mathematics turns on a property of theories, called (...)
    Download  
     
    Export citation  
     
    Bookmark   111 citations  
  • Deflating the conservativeness argument.Hartry Field - 1999 - Journal of Philosophy 96 (10):533-540.
    Download  
     
    Export citation  
     
    Bookmark   56 citations  
  • Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
    Download  
     
    Export citation  
     
    Bookmark   107 citations