George Boolos and Vann McGee. The degree of the set of sentences of predicate provability logic that are true under every interpretation. The journal of symbolic logic, vol. 52 , pp. 165–171

Journal of Symbolic Logic 56 (1):332 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274924

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

The degree of the set of sentences of predicate provability logic that are true under every interpretation.George Boolos & Vann McGee - 1987 - Journal of Symbolic Logic 52 (1):165-171.
Albert Visser. A course on bimodal provability logic. Annals of pure and applied logic, vol. 73 , pp. 109–142.Franco Montagna - 1997 - Journal of Symbolic Logic 62 (2):686-687.
Review: Albert Visser, A Course on Bimodal Provability Logic. [REVIEW]Franco Montagna - 1997 - Journal of Symbolic Logic 62 (2):686-687.
Vann McGee. Conditional probabilities and compounds of conditionals. The philosophical review, vol. 98 , pp. 485–541.Richard Jeffrey - 1991 - Journal of Symbolic Logic 56 (4):1493-1494.
George Boolos. The logic of provability. Cambridge University Press, Cambridge, New York, and Melbourne, 1993, xxxvi + 276 pp. [REVIEW]Sergei Artemov - 1995 - Journal of Symbolic Logic 60 (4):1316-1317.
Albert Visser. Submodels of Kripke models. Archive for mathematical logic, vol. 40 , pp. 277–295.Rosalie Iemhoff - 2002 - Bulletin of Symbolic Logic 8 (3):440-441.
Per Lindström. On characterizability in Lω1ω0. Theoria , vol. 32 , pp. 165–171.J. Malitz - 1970 - Journal of Symbolic Logic 35 (4):587.
George Boolos. To be is to be a value of a variable . The journal of philosophy, vol. 81 , pp. 430–449. - George Boolos. Nominalist Platonism, The philosophical review, vol. 94 , pp. 327–344. [REVIEW]John P. Burgess - 1989 - Journal of Symbolic Logic 54 (2):616-617.
George Boolos and Hilary Putnam. Degrees of unsolvability of constructible sets of integers. The journal of symbolic logic, vol. 33 no. 4 , pp. 497–513.A. S. Kechris - 1973 - Journal of Symbolic Logic 38 (3):527-528.
George S. Boolos. A proof of the Löwenheim-Skolem theorem. Notre Dame journal of formal logic, vol. 11 , pp. 76–78.Warren D. Goldfarb - 1973 - Journal of Symbolic Logic 38 (3):519.

Analytics

Added to PP
2013-11-03

Downloads
16 (#227,957)

6 months
1 (#1,912,481)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references