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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,499

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

Logic of proofs.Sergei Artëmov - 1994 - Annals of Pure and Applied Logic 67 (1-3):29-59.
Arithmetical completeness theorems for monotonic modal logics.Haruka Kogure & Taishi Kurahashi - 2023 - Annals of Pure and Applied Logic 174 (7):103271.
Completeness proofs for propositional logic with polynomial-time connectives.John N. Crossley & Philip J. Scott - 1989 - Annals of Pure and Applied Logic 44 (1-2):39-52.
Analytic logic of proofs.Francesca Poggiolesi & Brian Hill - forthcoming - Annals of Pure and Applied Logic.
Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.
Sub-arithmetical ultrapowers: a survey.Thomas G. McLaughlin - 1990 - Annals of Pure and Applied Logic 49 (2):143-191.
Provability logic and the completeness principle.Albert Visser & Jetze Zoethout - 2019 - Annals of Pure and Applied Logic 170 (6):718-753.
Completeness in local positive logic.Arturo Rodríguez Fanlo & Ori Segel - 2025 - Annals of Pure and Applied Logic 176 (7):103601.
Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
A completeness proof for adapted probability logic.H. Jerome Keisler - 1986 - Annals of Pure and Applied Logic 31:61-70.

Analytics

Added to PP
2018-09-23

Downloads
23 (#1,091,685)

6 months
3 (#1,323,969)

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