Switch to: References

Add citations

You must login to add citations.
  1. Epistemic Modality and Hyperintensionality in Mathematics.Timothy Bowen - 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   4 citations  
  • Proof systems for BAT consequence relations.Pawel Pawlowski - 2018 - Logic Journal of the IGPL 26 (1):96-108.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Logic of informal provability with truth values.Pawel Pawlowski & Rafal Urbaniak - 2023 - Logic Journal of the IGPL 31 (1):172-193.
    Classical logic of formal provability includes Löb’s theorem, but not reflection. In contrast, intuitions about the inferential behavior of informal provability (in informal mathematics) seem to invalidate Löb’s theorem and validate reflection (after all, the intuition is, whatever mathematicians prove holds!). We employ a non-deterministic many-valued semantics and develop a modal logic T-BAT of an informal provability operator, which indeed does validate reflection and invalidates Löb’s theorem. We study its properties and its relation to known provability-related paradoxical arguments. We also (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Informal provability and dialetheism.Pawel Pawlowski & Rafal Urbaniak - 2023 - Theoria 89 (2):204-215.
    According to the dialetheist argument from the inconsistency of informal mathematics, the informal version of the Gödelian argument leads us to a true contradiction. On one hand, the dialetheist argues, we can prove that there is a mathematical claim that is neither provable nor refutable in informal mathematics. On the other, the proof of its unprovability is given in informal mathematics and proves that very sentence. We argue that the argument fails, because it relies on the unjustified and unlikely assumption (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Informal Provability, First-Order BAT Logic and First Steps Towards a Formal Theory of Informal Provability.Pawel Pawlowski & Rafal Urbaniak - forthcoming - Logic and Logical Philosophy:1-27.
    BAT is a logic built to capture the inferential behavior of informal provability. Ultimately, the logic is meant to be used in an arithmetical setting. To reach this stage it has to be extended to a first-order version. In this paper we provide such an extension. We do so by constructing non-deterministic three-valued models that interpret quantifiers as some sorts of infinite disjunctions and conjunctions. We also elaborate on the semantical properties of the first-order system and consider a couple of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 1996 European Summer Meeting of the Association for Symbolic Logic.G. Mints, M. Otero, S. Ronchi Della Rocca & K. Segerberg - 1997 - Bulletin of Symbolic Logic 3 (2):242-277.
    Download  
     
    Export citation  
     
    Bookmark  
  • 1996 European Summer Meeting of the Association for Symbolic Logic.Daniel Lascar - 1997 - Bulletin of Symbolic Logic 3 (2):242-277.
    Download  
     
    Export citation  
     
    Bookmark  
  • Reflecting in epistemic arithmetic.Leon Horsten - 1996 - Journal of Symbolic Logic 61 (3):788-801.
    An epistemic formalization of arithmetic is constructed in which certain non-trivial metatheoretical inferences about the system itself can be made. These inferences involve the notion of provability in principle, and cannot be made in any consistent extensions of Stewart Shapiro's system of epistemic arithmetic. The system constructed in the paper can be given a modal-structural interpretation.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • In defense of epistemic arithmetic.Leon Horsten - 1998 - Synthese 116 (1):1-25.
    This paper presents a defense of Epistemic Arithmetic as used for a formalization of intuitionistic arithmetic and of certain informal mathematical principles. First, objections by Allen Hazen and Craig Smorynski against Epistemic Arithmetic are discussed and found wanting. Second, positive support is given for the research program by showing that Epistemic Arithmetic can give interesting formulations of Church's Thesis.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • The epistemic significance of numerals.Jan Heylen - 2014 - Synthese 198 (Suppl 5):1019-1045.
    The central topic of this article is (the possibility of) de re knowledge about natural numbers and its relation with names for numbers. It is held by several prominent philosophers that (Peano) numerals are eligible for existential quantification in epistemic contexts (‘canonical’), whereas other names for natural numbers are not. In other words, (Peano) numerals are intimately linked with de re knowledge about natural numbers, whereas the other names for natural numbers are not. In this article I am looking for (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modal-Epistemic Arithmetic and the problem of quantifying in.Jan Heylen - 2013 - Synthese 190 (1):89-111.
    The subject of this article is Modal-Epistemic Arithmetic (MEA), a theory introduced by Horsten to interpret Epistemic Arithmetic (EA), which in turn was introduced by Shapiro to interpret Heyting Arithmetic. I will show how to interpret MEA in EA such that one can prove that the interpretation of EA is MEA is faithful. Moreover, I will show that one can get rid of a particular Platonist assumption. Then I will discuss models for MEA in light of the problems of logical (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Closure of A Priori Knowability Under A Priori Knowable Material Implication.Jan Heylen - 2015 - Erkenntnis 80 (2):359-380.
    The topic of this article is the closure of a priori knowability under a priori knowable material implication: if a material conditional is a priori knowable and if the antecedent is a priori knowable, then the consequent is a priori knowable as well. This principle is arguably correct under certain conditions, but there is at least one counterexample when completely unrestricted. To deal with this, Anderson proposes to restrict the closure principle to necessary truths and Horsten suggests to restrict it (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Anti-Realism and Modal-Epistemic Collapse: Reply to Marton.Jan Heylen - 2021 - Erkenntnis 88 (1):397-408.
    Marton ( 2019 ) argues that that it follows from the standard antirealist theory of truth, which states that truth and possible knowledge are equivalent, that knowing possibilities is equivalent to the possibility of knowing, whereas these notions should be distinct. Moreover, he argues that the usual strategies of dealing with the Church–Fitch paradox of knowability are either not able to deal with his modal-epistemic collapse result or they only do so at a high price. Against this, I argue that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations