- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the proofs of arithmetical completeness for interpretability logic
Notre Dame Journal of Formal Logic 33 (4):542-551 (1992)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
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.
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
26 (#837,764)
6 months
9 (#449,585)
2010-08-24
Downloads
26 (#837,764)
6 months
9 (#449,585)
Historical graph of downloads
Citations of this work
The interpretability logic of all reasonable arithmetical theories.Joost J. Joosten & Albert Visser - 2000 - Erkenntnis 53 (1-2):3-26.
Undecidability in diagonalizable algebras.V. Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.
A Simple Proof of Arithmetical Completeness for $\Pi_1$ -Conservativity Logic.Giorgi Japaridze - 1994 - Notre Dame Journal of Formal Logic 35 (3):346-354.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lxkd2 dc2