Abstract
We present a quite simple proof of the fixed point theorem for GL. We also use this proof to show that Sambin's algorithm yields a fixed point.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boolos, G.: The Unprovability of Consistency, Cambridge University Press, 1979.
Boolos, G.: The Logic of Provability, Cambridge University Press, 1993.
Lindström, P.: Provability logic – a short introduction, Theoria 62 (1996), 19–61.
Sambin, G.: An effective fixed point theorem in intuitionistic diagonalizable algebras, Stud. Log., 35 (1976), 345–361.
Sambin, G. and Valentini, S.: The modal logic of provability. The sequential approach, J. Philos. Logic, 11 (1982), 311–342.
Smorynski, C.: Self-Reference and Modal Logic, Springer, 1985.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lindström, P. Note on Some Fixed Point Constructions in Provability Logic. J Philos Logic 35, 225–230 (2006). https://doi.org/10.1007/s10992-005-9013-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10992-005-9013-8