A simplification of the completeness proofs for Guaspari and Solovay's ${\rm R}$

Notre Dame Journal of Formal Logic 31 (1):44-63 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

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

Through your library

Similar books and articles

On the proofs of arithmetical completeness for interpretability logic.Domenico Zambella - 1992 - Notre Dame Journal of Formal Logic 33 (4):542-551.
Some proofs of relative completeness in modal logic.M. J. Cresswell - 1968 - Notre Dame Journal of Formal Logic 9 (1):62-66.
Quick completeness proofs for some logics of conditionals.John P. Burgess - 1981 - Notre Dame Journal of Formal Logic 22 (1):76-84.
A note on ${\rm R}_{\rightarrow}$ matrices.Robert K. Meyer - 1983 - Notre Dame Journal of Formal Logic 24 (4):450-472.

Analytics

Added to PP
2010-08-24

Downloads
26 (#599,290)

6 months
10 (#382,663)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Self-Reference in Arithmetic II.Volker Halbach & Albert Visser - 2014 - Review of Symbolic Logic 7 (4):692-712.
Uniform Density in Lindenbaum Algebras.V. Yu Shavrukov & Albert Visser - 2014 - Notre Dame Journal of Formal Logic 55 (4):569-582.
Much Shorter Proofs.Dick de Jongh & Franco Montagna - 1989 - Mathematical Logic Quarterly 35 (3):247-260.
Rosser Orderings in Bimodal Logics.Alessandra Carbone & Franco Montagna - 1989 - Mathematical Logic Quarterly 35 (4):343-358.

Add more citations

References found in this work

No references found.

Add more references