A new proof of the fixed-point theorem of provability logic (Q923072): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1305/ndjfl/1093635331 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972110795 / rank | |||
Normal rank | |||
Latest revision as of 03:39, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new proof of the fixed-point theorem of provability logic |
scientific article |
Statements
A new proof of the fixed-point theorem of provability logic (English)
0 references
1990
0 references
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.
0 references
fixed-point theorem
0 references
modal logic G of provability
0 references
Kripke models
0 references
