A new proof of the fixed-point theorem of provability logic
type: Item
instance of: scholarly article
title: A new proof of the fixed-point theorem of provability logic
zbMATH Open document ID: 0712.03011
author: Lisa Reidhaar-Olson
published in: Notre Dame Journal of Formal Logic
publication date: 1990-01-01T00:00:00Z
review text: A semantic proof of the fixed-point theorem for the modal logic G of provability is given, modeled after Sambin's syntactic proof, which is rather complicated but provides algorithms for the explicit calculation of fixed-points. The new proof featuring Kripke models is simple and shows an algorithm for fixed-point calculation as well, with which the fixed-point is obtained in the same general appearance as the original formula. Some examples of fixed-point calculations are also given.
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03F40
zbMATH DE Number: 4170869
zbMATH Keywords: fixed-point theorem
zbMATH Keywords: modal logic G of provability
zbMATH Keywords: Kripke models
reviewed by: Osamu Sonobe
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1305/ndjfl/1093635331
OpenAlex ID: W1972110795
DOI: 10.1305/NDJFL/1093635331
Recommended article: Note on some fixed point constructions in provability logic
Recommended article: Q5870840
Recommended article: PROVABILITY LOGICS RELATIVE TO A FIXED EXTENSION OF PEANO ARITHMETIC
Recommended article: A proof theory for the logic of provability in true arithmetic
Recommended article: New proofs in default logic theory
Recommended article: Explicit Proofs in Formal Provability Logic
Recommended article: The proof-theoretic analysis of transfinitely iterated fixed point theories
Recommended article: Provability logics with quantifiers on proofs
Recommended article: Q3804703
Recommended article: Q5698282
description: scientific article; zbMATH DE number 4170869