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 language | English |
---|---|
Pages (from-to) | 299-309 |
Number of pages | 11 |
Journal | Notre Dame Journal of Formal Logic |
Volume | 47 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2006 |
Keywords
- Constructive arithmetical theories
- Propositional logic
- Realizability