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)|
|Through your library||Configure|
Similar books and articles
Michael Rathjen (1999). Explicit Mathematics with the Monotone Fixed Point Principle. II: Models. Journal of Symbolic Logic 64 (2):517-550.
C. Smoryński (1981). Calculating Self-Referential Statements: Guaspari Sentences of the First Kind. Journal of Symbolic Logic 46 (2):329-344.
Johan Van Benthem (2005). Minimal Predicates. Fixed-Points, and Definability. Journal of Symbolic Logic 70 (3):696 - 712.
Michael Rathjen (1998). Explicit Mathematics with the Monotone Fixed Point Principle. Journal of Symbolic Logic 63 (2):509-542.
Robert M. Solovay (1985). Explicit Henkin Sentences. Journal of Symbolic Logic 50 (1):91-93.
Noson S. Yanofsky (2003). A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points. Bulletin of Symbolic Logic 9 (3):362-386.
Dick Jongh & Albert Visser (1991). Explicit Fixed Points in Interpretability Logic. Studia Logica 50 (1):39 - 49.
Added to index2009-01-28
Total downloads13 ( #95,541 of 722,859 )
Recent downloads (6 months)1 ( #60,917 of 722,859 )
How can I increase my downloads?