Propositional logics of closed and open substitutions over heyting's arithmetic

Albert Visser*

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

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.

Original languageEnglish
Pages (from-to)299-309
Number of pages11
JournalNotre Dame Journal of Formal Logic
Volume47
Issue number3
DOIs
Publication statusPublished - 2006

Keywords

  • Constructive arithmetical theories
  • Propositional logic
  • Realizability

Fingerprint

Dive into the research topics of 'Propositional logics of closed and open substitutions over heyting's arithmetic'. Together they form a unique fingerprint.

Cite this