Switch to: References

Citations of:

Godel's Theorem in Focus

Routledge (1987)

Add citations

You must login to add citations.
  1. ‘Whys’ and ‘Hows’ of Using Philosophy in Mathematics Education.Uffe Thomas Jankvist & Steffen Møllegaard Iversen - 2014 - Science & Education 23 (1):205-222.
    Download  
     
    Export citation  
     
    Bookmark  
  • The Perceiver's Share: Realism, Scepticism, and Response Dependence.Christopher Norris - 2003 - Metaphilosophy 34 (4):387-424.
    Response‐dispositional (RD) properties are standardly defined as those that involve an object's appearing thus or thus to some perceptually well‐equipped observer under specified epistemic conditions. The paradigm instance is that of colour or other such Lockean “secondary qualities”, as distinct from those—like shape and size—that pertain to the object itself, quite apart from anyone's perception. This idea has lately been thought to offer a promising alternative to the deadlocked dispute between hard‐line ‘metaphysical’ realists and subjectivists, projectivists, social constructivists, or hard‐line (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Arithmetical and specular self-reference.Damjan Bojadžiev - 2004 - Acta Analytica 19 (33):55-63.
    Arithmetical self-reference through diagonalization is compared with self-recognition in a mirror, in a series of diagrams that show the structure and main stages of construction of self-referential sentences. A Gödel code is compared with a mirror, Gödel numbers with mirror images, numerical reference to arithmetical formulas with using a mirror to see things indirectly, self-reference with looking at one’s own image, and arithmetical provability of self-reference with recognition of the mirror image. The comparison turns arithmetical self-reference into an idealized model (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Wittgenstein on Incompleteness Makes Paraconsistent Sense.Francesco Berto - 2008 - In Francesco Berto, Edwin Mares, Koji Tanaka & Francesco Paoli (eds.), Paraconsistency: Logic and Applications. Springer. pp. 257--276.
    I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The gödel paradox and Wittgenstein's reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
    An interpretation of Wittgenstein’s much criticized remarks on Gödel’s First Incompleteness Theorem is provided in the light of paraconsistent arithmetic: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was drawing the consequences of his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. It is shown that the features of paraconsistent arithmetics match (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Gödel on Truth and Proof.Dan Nesher - unknown
    Download  
     
    Export citation  
     
    Bookmark  
  • Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
    Gödel's two incompleteness theorems are among the most important results in modern logic, and have deep implications for various issues. They concern the limits of provability in formal axiomatic theories. The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F. According to the second incompleteness theorem, such a formal system cannot (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations