Generic Generalized Rosser Fixed Points

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

Abstract

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 completeness theorem with respect to PA is obtained for LR.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 98,109

External links

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

Through your library

Analytics

Added to PP
2017-02-21

Downloads
43 (#412,205)

6 months
7 (#589,429)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A small reflection principle for bounded arithmetic.Rineke Verbrugge & Albert Visser - 1994 - Journal of Symbolic Logic 59 (3):785-812.
On Rosser's Provability Predicate.V. Yu Shavrukov - 1991 - Mathematical Logic Quarterly 37 (19‐22):317-330.
On Rosser's Provability Predicate.V. Yu Shavrukov - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (19-22):317-330.
Much Shorter Proofs.Dick de Jongh & Franco Montagna - 1989 - Mathematical Logic Quarterly 35 (3):247-260.
Much Shorter Proofs.Dick de Jongh & Franco Montagna - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (3):247-260.

View all 7 citations / Add more citations