On the proofs of arithmetical completeness for interpretability logic

Notre Dame Journal of Formal Logic 33 (4):542-551 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093634485

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,168

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

An arithmetical completeness theorem for pre-permutations.Friedemann Tuttas - 1992 - Notre Dame Journal of Formal Logic 34 (1):84-89.
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 simplification of the completeness proofs for Guaspari and Solovay's ${\rm R}$.Frans Voorbraak - 1989 - Notre Dame Journal of Formal Logic 31 (1):44-63.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
Henkin style completeness proofs in theories lacking negation.John L. Pollock - 1971 - Notre Dame Journal of Formal Logic 12 (4):509-511.
Unary interpretability logic.Maarten de Rijke - 1992 - Notre Dame Journal of Formal Logic 33 (2):249-272.
Frans Voorbraak. A simplification of the completeness proofs for Guaspari and Solovay's R. Notre Dame journal of formal logic, vol. 31 , pp. 44–63. [REVIEW]Franco Montagna - 1993 - Journal of Symbolic Logic 58 (2):717-719.
On certain lattices of degrees of interpretability.Per Lindström - 1984 - Notre Dame Journal of Formal Logic 25 (2):127-140.
On the interpretability of arithmetic in set theory.George E. Collins & J. D. Halpern - 1970 - Notre Dame Journal of Formal Logic 11 (4):477-483.

Analytics

Added to PP
2010-08-24

Downloads
33 (#763,874)

6 months
9 (#445,453)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Undecidability in diagonalizable algebras.V. Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references