A Simplification of a Completeness Proof of Guaspari and Solovay

Studia Logica 46 (2):187-192 (1987)
  Copy   BIBTEX

Abstract

The modal completeness proofs of Guaspari and Solovay for their systems R and R⁻ are improved and the relationship between R and R⁻ is clarified.

Links

PhilArchive



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

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
13 (#1,065,706)

6 months
2 (#1,259,626)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Comparing strengths of beliefs explicitly.S. Ghosh & D. de Jongh - 2013 - Logic Journal of the IGPL 21 (3):488-514.
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 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (19-22):317-330.

View all 14 citations / Add more citations

References found in this work

Self-Reference and Modal Logic.[author unknown] - 1987 - Studia Logica 46 (4):395-398.
Rosser sentences.D. Guaspari - 1979 - Annals of Mathematical Logic 16 (1):81.

Add more references