Closed fragments of provability logics of constructive theories

Journal of Symbolic Logic 73 (3):1081-1096 (2008)
  Copy   BIBTEX

Abstract

In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the closed fragment of the provability logic of Heyting's Arithmetic plus Markov's Principle and Heyting's Arithmetic plus Primitive Recursive Markov's Principle

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,676

External links

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

Through your library

Similar books and articles

Markov's Rule revisited.Daniel Leivant - 1990 - Archive for Mathematical Logic 30 (2):125-127.
Predicate Logics of Constructive Arithmetical Theories.Albert Visser - 2006 - Journal of Symbolic Logic 71 (4):1311 - 1326.
A course on bimodal provability logic.Albert Visser - 1995 - Annals of Pure and Applied Logic 73 (1):109-142.
An Escape From Vardanyan’s Theorem.Ana de Almeida Borges & Joost J. Joosten - 2023 - Journal of Symbolic Logic 88 (4):1613-1638.

Analytics

Added to PP
2010-09-12

Downloads
46 (#478,016)

6 months
11 (#334,289)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.

Add more citations