On arithmetical completeness of the logic of proofs

&
Annals of Pure and Applied Logic 170 (2):163-179 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2018.09.004

Links

PhilArchive



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

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

Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.
Analytic logic of proofs.Francesca Poggiolesi & Brian Hill - forthcoming - Annals of Pure and Applied Logic.
Completeness results for memory logics.Carlos Areces, Santiago Figueira & Sergio Mera - 2012 - Annals of Pure and Applied Logic 163 (7):961-972.
The logic of proofs, semantically.Melvin Fitting - 2005 - Annals of Pure and Applied Logic 132 (1):1-25.
On the proofs of arithmetical completeness for interpretability logic.Domenico Zambella - 1992 - Notre Dame Journal of Formal Logic 33 (4):542-551.
Propositional proofs and reductions between NP search problems.Samuel R. Buss & Alan S. Johnson - 2012 - Annals of Pure and Applied Logic 163 (9):1163-1182.
Automated search for Gödel’s proofs.Wilfried Sieg & Clinton Field - 2005 - Annals of Pure and Applied Logic 133 (1):319-338.
Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators.Toshiyasu Arai - 2010 - Annals of Pure and Applied Logic 162 (2):107-143.
Arithmetical complexity of fuzzy predicate logics—a survey II.Petr Hájek - 2010 - Annals of Pure and Applied Logic 161 (2):212-219.
On lengths of proofs in non-classical logics.Pavel Hrubeš - 2009 - Annals of Pure and Applied Logic 157 (2-3):194-205.

Analytics

Added to PP
2018-09-23

Downloads
18 (#860,222)

6 months
8 (#415,230)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
Aspects of Incompleteness.Per Lindström - 1999 - Studia Logica 63 (3):438-439.
On modal systems having arithmetical interpretations.Arnon Avron - 1984 - Journal of Symbolic Logic 49 (3):935-942.
Extremely undecidable sentences.George Boolos - 1982 - Journal of Symbolic Logic 47 (1):191-196.

Add more references