Switch to: References

Add citations

You must login to add citations.
  1. Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Modal Ω-Logic: Automata, Neo-Logicism, and Set-theoretic Realism.Hasen Khudairi - 2017 - In Khudairi Hasen (ed.), 'Proceedings of the 2016 Annual Meeting of the International Association for Computing and Philosophy'.
    This essay examines the philosophical significance of Ω-logic in Zermelo-Fraenkel set theory with choice (ZFC). The dual isomorphism between algebra and coalgebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The modal profile of Ω-logical validity can then be countenanced within a coalgebraic logic, and Ω-logical validity can be defined via deterministic automata. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal profiles of Ω-logical validity correspond to those of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Yablo Without Gödel.Volker Halbach & Shuoying Zhang - 2017 - Analysis 77 (1):53-59.
    We prove Yablo’s paradox without the diagonal lemma or the recursion theorem. Only a disquotation schema and axioms for a serial and transitive ordering are used in the proof. The consequences for the discussion on whether Yablo’s paradox is circular or involves self-reference are evaluated.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Hyperintensional Ω-Logic.David Elohim - 2019 - In Matteo Vincenzo D'Alfonso & Don Berkich (eds.), On the Cognitive, Ethical, and Scientific Dimensions of Artificial Intelligence. Springer Verlag. pp. 65-82.
    This paper examines the philosophical significance of the consequence relation defined in the $\Omega$-logic for set-theoretic languages. I argue that, as with second-order logic, the hyperintensional profile of validity in $\Omega$-Logic enables the property to be epistemically tractable. Because of the duality between coalgebras and algebras, Boolean-valued models of set theory can be interpreted as coalgebras. In Section \textbf{2}, I demonstrate how the hyperintensional profile of $\Omega$-logical validity can be countenanced within a coalgebraic logic. Finally, in Section \textbf{3}, the philosophical (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Hyperintensional Ω-Logic.David Elohim - 2019 - In Matteo Vincenzo D'Alfonso & Don Berkich (eds.), On the Cognitive, Ethical, and Scientific Dimensions of Artificial Intelligence. Springer Verlag.
    This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory with choice (ZFC). The categorical duality between coalgebra and algebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The hyperintensional profile of $\Omega$-logical validity can then be countenanced within a coalgebraic logic. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal and hyperintensional profiles of $\Omega$-logical validity correspond to those of second-order logical consequence, $\Omega$-logical validity is genuinely (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The absorption law: Or: how to Kreisel a Hilbert–Bernays–Löb.Albert Visser - 2020 - Archive for Mathematical Logic 60 (3-4):441-468.
    In this paper, we show how to construct for a given consistent theory U a $$\varSigma ^0_1$$ Σ 1 0 -predicate that both satisfies the Löb Conditions and the Kreisel Condition—even if U is unsound. We do this in such a way that U itself can verify satisfaction of an internal version of the Kreisel Condition.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Unified Theory of Truth and Paradox.Lorenzo Rossi - 2019 - Review of Symbolic Logic 12 (2):209-254.
    The sentences employed in semantic paradoxes display a wide range of semantic behaviours. However, the main theories of truth currently available either fail to provide a theory of paradox altogether, or can only account for some paradoxical phenomena by resorting to multiple interpretations of the language. In this paper, I explore the wide range of semantic behaviours displayed by paradoxical sentences, and I develop a unified theory of truth and paradox, that is a theory of truth that also provides a (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • HYPER-REF: A General Model of Reference for First-Order Logic and First-Order Arithmetic.Pablo Rivas-Robledo - 2022 - Kriterion – Journal of Philosophy 36 (2):179-205.
    In this article I present HYPER-REF, a model to determine the referent of any given expression in First-Order Logic. I also explain how this model can be used to determine the referent of a first-order theory such as First-Order Arithmetic. By reference or referent I mean the non-empty set of objects that the syntactical terms of a well-formed formula pick out given a particular interpretation of the language. To do so, I will first draw on previous work to make explicit (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Reference and Truth.Lavinia Picollo - 2020 - Journal of Philosophical Logic 49 (3):439-474.
    I apply the notions of alethic reference introduced in previous work in the construction of several classical semantic truth theories. Furthermore, I provide proof-theoretic versions of those notions and use them to formulate axiomatic disquotational truth systems over classical logic. Some of these systems are shown to be sound, proof-theoretically strong, and compare well to the most renowned systems in the literature.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Reference in arithmetic.Lavinia Picollo - 2018 - Review of Symbolic Logic 11 (3):573-603.
    Self-reference has played a prominent role in the development of metamathematics in the past century, starting with Gödel’s first incompleteness theorem. Given the nature of this and other results in the area, the informal understanding of self-reference in arithmetic has sufficed so far. Recently, however, it has been argued that for other related issues in metamathematics and philosophical logic a precise notion of self-reference and, more generally, reference is actually required. These notions have been so far elusive and are surrounded (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Internalism and the Determinacy of Mathematics.Lavinia Picollo & Daniel Waxman - 2023 - Mind 132 (528):1028-1052.
    A major challenge in the philosophy of mathematics is to explain how mathematical language can pick out unique structures and acquire determinate content. In recent work, Button and Walsh have introduced a view they call ‘internalism’, according to which mathematical content is explained by internal categoricity results formulated and proven in second-order logic. In this paper, we critically examine the internalist response to the challenge and discuss the philosophical significance of internal categoricity results. Surprisingly, as we argue, while internalism arguably (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Alethic Reference.Lavinia Picollo - 2020 - Journal of Philosophical Logic 49 (3):417-438.
    I put forward precise and appealing notions of reference, self-reference, and well-foundedness for sentences of the language of first-order Peano arithmetic extended with a truth predicate. These notions are intended to play a central role in the study of the reference patterns that underlie expressions leading to semantic paradox and, thus, in the construction of philosophically well-motivated semantic theories of truth.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the Arithmetical Truth of Self‐Referential Sentences.Kaave Lajevardi & Saeed Salehi - 2019 - Theoria 85 (1):8-17.
    We take an argument of Gödel's from his ground‐breaking 1931 paper, generalize it, and examine its validity. The argument in question is this: "the sentence G says about itself that it is not provable, and G is indeed not provable; therefore, G is true".
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Valuing and believing valuable.Kubala Robbie - 2017 - Analysis 77 (1):59-65.
    Many philosophers recognize that, as a matter of psychological fact, one can believe something valuable without valuing it. I argue that it is also possible to value something without believing it valuable. Agents can genuinely value things that they neither believe disvaluable nor believe valuable along a scale of impersonal value.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Gödel’s Theorem and Direct Self-Reference.Saul A. Kripke - 2023 - Review of Symbolic Logic 16 (2):650-654.
    In his paper on the incompleteness theorems, Gödel seemed to say that a direct way of constructing a formula that says of itself that it is unprovable might involve a faulty circularity. In this note, it is proved that ‘direct’ self-reference can actually be used to prove his result.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Axiomatic Theories of Partial Ground II: Partial Ground and Hierarchies of Typed Truth.Johannes Korbmacher - 2018 - Journal of Philosophical Logic 47 (2):193-226.
    This is part two of a two-part paper in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. In this part of the paper, we extend the base theory of the first part of the paper with hierarchically typed truth-predicates and principles about the interaction of partial ground and truth. We show that our theory is (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Non‐Classical Knowledge.Ethan Jerzak - 2017 - Philosophy and Phenomenological Research 98 (1):190-220.
    The Knower paradox purports to place surprising a priori limitations on what we can know. According to orthodoxy, it shows that we need to abandon one of three plausible and widely-held ideas: that knowledge is factive, that we can know that knowledge is factive, and that we can use logical/mathematical reasoning to extend our knowledge via very weak single-premise closure principles. I argue that classical logic, not any of these epistemic principles, is the culprit. I develop a consistent theory validating (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Varieties of Self-Reference in Metamathematics.Balthasar Grabmayr, Volker Halbach & Lingyuan Ye - 2023 - Journal of Philosophical Logic 52 (4):1005-1052.
    This paper investigates the conditions under which diagonal sentences can be taken to constitute paradigmatic cases of self-reference. We put forward well-motivated constraints on the diagonal operator and the coding apparatus which separate paradigmatic self-referential sentences, for instance obtained via Gödel’s diagonalization method, from accidental diagonal sentences. In particular, we show that these constraints successfully exclude refutable Henkin sentences, as constructed by Kreisel.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Self-Reference Upfront: A Study of Self-Referential Gödel Numberings.Balthasar Grabmayr & Albert Visser - 2023 - Review of Symbolic Logic 16 (2):385-424.
    In this paper we examine various requirements on the formalisation choices under which self-reference can be adequately formalised in arithmetic. In particular, we study self-referential numberings, which immediately provide a strong notion of self-reference even for expressively weak languages. The results of this paper suggest that the question whether truly self-referential reasoning can be formalised in arithmetic is more sensitive to the underlying coding apparatus than usually believed. As a case study, we show how this sensitivity affects the formal study (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On the Invariance of Gödel’s Second Theorem with Regard to Numberings.Balthasar Grabmayr - 2021 - Review of Symbolic Logic 14 (1):51-84.
    The prevalent interpretation of Gödel’s Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of the underlying mathematical theorem depends on several arbitrary formalisation choices. In this paper I examine the theorem’s dependency regarding Gödel numberings. I introducedeviantnumberings, yielding provability predicates satisfying Löb’s conditions, which result in provable consistency sentences. According to the main result of this paper however, these (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A Step Towards Absolute Versions of Metamathematical Results.Balthasar Grabmayr - 2024 - Journal of Philosophical Logic 53 (1):247-291.
    There is a well-known gap between metamathematical theorems and their philosophical interpretations. Take Tarski’s Theorem. According to its prevalent interpretation, the collection of all arithmetical truths is not arithmetically definable. However, the underlying metamathematical theorem merely establishes the arithmetical undefinability of a set of specific Gödel codes of certain artefactual entities, such as infix strings, which are true in the standard model. That is, as opposed to its philosophical reading, the metamathematical theorem is formulated (and proved) relative to a specific (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Model Theory and Proof Theory of the Global Reflection Principle.Mateusz Zbigniew Łełyk - 2023 - Journal of Symbolic Logic 88 (2):738-779.
    The current paper studies the formal properties of the Global Reflection Principle, to wit the assertion “All theorems of$\mathrm {Th}$are true,” where$\mathrm {Th}$is a theory in the language of arithmetic and the truth predicate satisfies the usual Tarskian inductive conditions for formulae in the language of arithmetic. We fix the gap in Kotlarski’s proof from [15], showing that the Global Reflection Principle for Peano Arithmetic is provable in the theory of compositional truth with bounded induction only ($\mathrm {CT}_0$). Furthermore, we (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A defense of Isaacson’s thesis, or how to make sense of the boundaries of finite mathematics.Pablo Dopico - 2024 - Synthese 203 (2):1-22.
    Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it can be (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Incompleteness Via Paradox and Completeness.Walter Dean - 2020 - Review of Symbolic Logic 13 (3):541-592.
    This paper explores the relationship borne by the traditional paradoxes of set theory and semantics to formal incompleteness phenomena. A central tool is the application of the Arithmetized Completeness Theorem to systems of second-order arithmetic and set theory in which various “paradoxical notions” for first-order languages can be formalized. I will first discuss the setting in which this result was originally presented by Hilbert & Bernays (1939) and also how it was later adapted by Kreisel (1950) and Wang (1955) in (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the Depth of Gödel’s Incompleteness Theorems.Yong Cheng - forthcoming - Philosophia Mathematica.
    ABSTRACT We use Gödel’s incompleteness theorems as a case study for investigating mathematical depth. We examine the philosophical question of what the depth of Gödel’s incompleteness theorems consists in. We focus on the methodological study of the depth of Gödel’s incompleteness theorems, and propose three criteria to account for the depth of the incompleteness theorems: influence, fruitfulness, and unity. Finally, we give some explanations for our account of the depth of Gödel’s incompleteness theorems.
    Download  
     
    Export citation  
     
    Bookmark  
  • Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
    We give a survey of current research on Gödel’s incompleteness theorems from the following three aspects: classifications of different proofs of Gödel’s incompleteness theorems, the limit of the applicability of Gödel’s first incompleteness theorem, and the limit of the applicability of Gödel’s second incompleteness theorem.
    Download  
     
    Export citation  
     
    Bookmark   4 citations