Propositional Logics of Closed and Open Substitutions over Heyting's Arithmetic

Notre Dame Journal of Formal Logic 47 (3):299-309 (2006)
  Copy   BIBTEX

Abstract

In this note we compare propositional logics for closed substitutions and propositional logics for open substitutions in constructive arithmetical theories. We provide a strong example where these logics diverge in an essential way. We prove that for Markov's Arithmetic, that is, Heyting's Arithmetic plus Markov's principle plus Extended Church's Thesis, the logic of closed and the logic of open substitutions are the same

Other Versions

No versions found

Links

PhilArchive



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

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

Closed fragments of provability logics of constructive theories.Albert Visser - 2008 - Journal of Symbolic Logic 73 (3):1081-1096.
Predicate Logics of Constructive Arithmetical Theories.Albert Visser - 2006 - Journal of Symbolic Logic 71 (4):1311 - 1326.
Rules and Arithmetics.Albert Visser - 1999 - Notre Dame Journal of Formal Logic 40 (1):116-140.
Structural completeness in propositional logics of dependence.Rosalie Iemhoff & Fan Yang - 2016 - Archive for Mathematical Logic 55 (7-8):955-975.
Markov's Rule revisited.Daniel Leivant - 1990 - Archive for Mathematical Logic 30 (2):125-127.
Reflexive Intermediate Propositional Logics.Nathan C. Carter - 2006 - Notre Dame Journal of Formal Logic 47 (1):39-62.
Bimodal logics for extensions of arithmetical theories.Lev D. Beklemishev - 1996 - Journal of Symbolic Logic 61 (1):91-124.

Analytics

Added to PP
2010-08-24

Downloads
49 (#443,886)

6 months
7 (#684,641)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A survey of propositional realizability logic.Valery Plisko - 2009 - Bulletin of Symbolic Logic 15 (1):1-42.

Add more citations

References found in this work

Incompleteness in intuitionistic metamathematics.David Charles McCarty - 1991 - Notre Dame Journal of Formal Logic 32 (3):323-358.
A semantical proof of De Jongh's theorem.Jaap van Oosten - 1991 - Archive for Mathematical Logic 31 (2):105-114.
Propositional Calculus and Realizability.Gene F. Rose - 1954 - Journal of Symbolic Logic 19 (2):126-126.

Add more references