Generic generalized Rosser fixed points

Studia Logica 46 (2):193 - 203 (1987)
  Copy   BIBTEX


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.



    Upload a copy of this work     Papers currently archived: 77,985

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

29 (#410,677)

6 months
1 (#485,425)

Historical graph of downloads
How can I increase my downloads?