Publisher: Cambridge University Press
E-ISSN: 1943-5886|73|3|1081-1096
ISSN: 0022-4812
Source: The Journal of Symbolic Logic, Vol.73, Iss.3, 2008-09, pp. : 1081-1096
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
Predicate Logics of Constructive Arithmetical Theories
The Journal of Symbolic Logic, Vol. 71, Iss. 4, 2006-12 ,pp. :
Explicit Provability and Constructive Semantics
Bulletin of Symbolic Logic, Vol. 7, Iss. 1, 2001-03 ,pp. :
Gödel Theorems for Non-Constructive Logics
The Journal of Symbolic Logic, Vol. 2, Iss. 3, 1937-09 ,pp. :
Counting the maximal intermediate constructive logics
The Journal of Symbolic Logic, Vol. 58, Iss. 4, 1993-12 ,pp. :
On Skolemization in constructive theories
The Journal of Symbolic Logic, Vol. 73, Iss. 3, 2008-09 ,pp. :