A simplification of the completeness proofs for Guaspari and Solovay's R (Q923070): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q588143 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Osamu Sonobe / rank | |||
Normal rank |
Revision as of 23:56, 19 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simplification of the completeness proofs for Guaspari and Solovay's R |
scientific article |
Statements
A simplification of the completeness proofs for Guaspari and Solovay's R (English)
0 references
1990
0 references
The author gives alternative completeness proofs for Guaspari and Solovay's modal logic R which characterizes the formal properties of provability predicate and witness comparison of PA. The Kripke model completeness is proved by using tail models instead of finite Kripke models, from which there follows the arithmetical completeness by literally embedding Kripke models in PA. The arithmetical completeness proved in this paper is slightly different from Guaspari and Solovay's and forms a solution to Smorynski's problem of obtaining a completeness result with respect to a variety of orderings.
0 references
provability logic
0 references
Guaspari and Solovay's modal logic R
0 references
witness comparison
0 references
Kripke model completeness
0 references
tail models
0 references
arithmetical completeness
0 references