Switch to: References

Citations of:

Godel's Disjunction: The Scope and Limits of Mathematical Knowledge

Oxford, England: Oxford University Press UK (2016)

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, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Modal Cognitivism and Modal Expressivism.Timothy Bowen - manuscript
    This paper aims to provide a mathematically tractable background against which to model both modal cognitivism and modal expressivism. I argue that epistemic modal algebras, endowed with a hyperintensional, topic-sensitive epistemic two-dimensional truthmaker semantics, comprise a materially adequate fragment of the language of thought. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are categorically dual. I examine five methods for modeling the dynamics of conceptual engineering for intensions and (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  • On Martin-Löf’s Constructive Optimism.V. Alexis Peluce - 2020 - Studia Semiotyczne 34 (1):233-242.
    In his 1951 Gibbs Memorial Lecture, Kurt Gödel put forth his famous disjunction that either the power of the mind outstrips that of any machine or there are absolutely unsolvable problems. The view that there are no absolutely unsolvable problems is optimism, the view that there are such problems is pessimism. In his 1995—and, revised in 2013—Verificationism Then and Now, Per Martin-Löf presents an illustrative argument for a constructivist form of optimism. In response to that argument, Solomon Feferman points out (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Proof systems for BAT consequence relations.Pawel Pawlowski - 2018 - Logic Journal of the IGPL 26 (1):96-108.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the Anti-Mechanist Arguments Based on Gödel’s Theorem.Stanisław Krajewski - 2020 - Studia Semiotyczne 34 (1):9-56.
    The alleged proof of the non-mechanical, or non-computational, character of the human mind based on Gödel’s incompleteness theorem is revisited. Its history is reviewed. The proof, also known as the Lucas argument and the Penrose argument, is refuted. It is claimed, following Gödel himself and other leading logicians, that antimechanism is not implied by Gödel’s theorems alone. The present paper sets out this refutation in its strongest form, demonstrating general theorems implying the inconsistency of Lucas’s arithmetic and the semantic inadequacy (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Gödel’s Incompleteness Theorem and the Anti-Mechanist Argument: Revisited.Yong Cheng - 2020 - Studia Semiotyczne 34 (1):159-182.
    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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Problematic Nature of Gödel’s Disjunctions and Lucas-Penrose’s Theses.Arnon Avron - 2020 - Studia Semiotyczne 34 (1):83-108.
    We show that the name “Lucas-Penrose thesis” encompasses several different theses. All these theses refer to extremely vague concepts, and so are either practically meaningless, or obviously false. The arguments for the various theses, in turn, are based on confusions with regard to the meaning of these vague notions, and on unjustified hidden assumptions concerning them. All these observations are true also for all interesting versions of the much weaker thesis known as “Gö- del disjunction”. Our main conclusions are that (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Human-Effective Computability†.Marianna Antonutti Marfori & Leon Horsten - 2018 - Philosophia Mathematica 27 (1):61-87.
    We analyse Kreisel’s notion of human-effective computability. Like Kreisel, we relate this notion to a concept of informal provability, but we disagree with Kreisel about the precise way in which this is best done. The resulting two different ways of analysing human-effective computability give rise to two different variants of Church’s thesis. These are both investigated by relating them to transfinite progressions of formal theories in the sense of Feferman.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation