Generic generalized Rosser fixed points

Studia Logica 46 (2):193 - 203 (1987)
To the standard propositional modal system of provability logic constants are added to account for the arithmetical fixed points introduced by Bernardi-Montagna in [5]. With that interpretation in mind, a system LR of modal propositional logic is axiomatized, a modal completeness theorem is established for LR and, after that, a uniform arithmetical (Solovay-type) completeness theorem with respect to PA is obtained for LR.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370381
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,694
Through your library
References found in this work BETA
Self-Reference and Modal Logic.George Boolos & C. Smorynski - 1988 - Journal of Symbolic Logic 53 (1):306.

View all 9 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
11 ( #415,343 of 2,197,251 )

Recent downloads (6 months)
1 ( #298,963 of 2,197,251 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature