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

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,261

External links

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

Through your library

Analytics

Added to PP
2010-09-12

Downloads
54 (#441,583)

6 months
11 (#335,171)

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