Studia Logica 38 (1):17 - 36 (1979)

Abstract
The proof of the Second Incompleteness Theorem consists essentially of proving the uniqueness and explicit definability of the sentence asserting its own unprovability. This turns out to be a rather general phenomenon: Every instance of self-reference describable in the modal logic of the standard proof predicate obeys a similar uniqueness and explicit definability law. The efficient determination of the explicit definitions of formulae satisfying a given instance of self-reference reduces to a simple algebraic problem-that of solving the corresponding fixed-point equation in the modal logic. We survey techniques for the efficient calculation of such fixed-points.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00493670
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,401
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

The Incompleteness Theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of Mathematical Logic. North-Holland. pp. 821 -- 865.
Solution of a Problem of Leon Henkin.M. H. Löb - 1955 - Journal of Symbolic Logic 20 (2):115-118.

View all 7 references / Add more references

Citations of this work BETA

Sentences Implying Their Own Provability.David Guaspari - 1983 - Journal of Symbolic Logic 48 (3):777-789.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
73 ( #145,576 of 2,445,527 )

Recent downloads (6 months)
1 ( #457,040 of 2,445,527 )

How can I increase my downloads?

Downloads

My notes