Propositional Logics of Closed and Open Substitutions over Heyting's Arithmetic
Visser, Albert
Notre Dame J. Formal Logic, Tome 47 (2006) no. 1, p. 299-309 / Harvested from Project Euclid
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.
Publié le : 2006-07-14
Classification:  propositional logic,  constructive arithmetical theories,  realizability,  03F50,  03F30,  03B20
@article{1163775437,
     author = {Visser, Albert},
     title = {Propositional Logics of Closed and Open Substitutions over Heyting's Arithmetic},
     journal = {Notre Dame J. Formal Logic},
     volume = {47},
     number = {1},
     year = {2006},
     pages = { 299-309},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1163775437}
}
Visser, Albert. Propositional Logics of Closed and Open Substitutions over Heyting's Arithmetic. Notre Dame J. Formal Logic, Tome 47 (2006) no. 1, pp.  299-309. http://gdmltest.u-ga.fr/item/1163775437/