Switch to: References

Add citations

You must login to add citations.
  1. On a certain fallacy concerning I-am-unprovable sentences.Kaave Lajevardi & Saeed Salehi - manuscript
    We demonstrate that, in itself and in the absence of extra premises, the following argument scheme is fallacious: The sentence A says about itself that it has a property F, and A does in fact have the property F; therefore A is true. We then examine an argument of this form in the informal introduction of Gödel’s classic (1931) and examine some auxiliary premises which might have been at work in that context. Philosophically significant as it may be, that particular (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Remarks on the Gödelian Anti-Mechanist Arguments.Panu Raatikainen - 2020 - Studia Semiotyczne 34 (1):267–278.
    Certain selected issues around the Gödelian anti-mechanist arguments which have received less attention are discussed.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Gödel’s Disjunction: The Scope and Limits of Mathematical Knowledge. [REVIEW]Panu Raatikainen - 2018 - History and Philosophy of Logic 39 (4):401-403.
    Austrian-born Kurt Gödel is widely considered the greatest logician of modern times. It is above all his celebrated incompleteness theorems—rigorous mathematical results about the necessary limits...
    Download  
     
    Export citation  
     
    Bookmark  
  • There May Be Many Arithmetical Gödel Sentences.Kaave Lajevardi & Saeed Salehi - 2021 - Philosophia Mathematica 29 (2):278–287.
    We argue that, under the usual assumptions for sufficiently strong arithmetical theories that are subject to Gödel’s First Incompleteness Theorem, one cannot, without impropriety, talk about *the* Gödel sentence of the theory. The reason is that, without violating the requirements of Gödel’s theorem, there could be a true sentence and a false one each of which is provably equivalent to its own unprovability in the theory if the theory is unsound.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Undecidability and opacity of metacognition in animals and humans.Kevin B. Clark & Derrick L. Hassert - 2013 - Frontiers in Psychology 4.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Cómo hacer metafísica a partir de la lógica.Laureano Luna - 2012 - Thémata. Revista de Filosofía 45:261-274.
    We offer a number of arguments for or against particular metaphysical theses. All of them are based in phenomena or results in mathematical logic, broadly conceived, and are offered as exemplification of the possibility of arguing in metaphysics from such results.
    Download  
     
    Export citation  
     
    Bookmark