Markov's rule revisited
From MaRDI portal
Publication:2277259
Heyting Arithmetic extended with transfinite induction over all recursive well-orderings \((HA^*)\) is considered. It is shown that Markov's Principle is unprovable in \(HA^*\). On the other hand \(HA^*\) is proved to be closed under Markov's Rule (MR). This yields a new proof of the closure of a number of intuitionistic theories under MR.
Recommendations
Cites work
Cited in
(8)- scientific article; zbMATH DE number 4055607 (Why is no real title available?)
- scientific article; zbMATH DE number 1088199 (Why is no real title available?)
- The independence of Markov's principle in type theory
- The independence of Markov's principle in type theory
- scientific article; zbMATH DE number 4183402 (Why is no real title available?)
- Arithmetic complexity of the predicate logics of certain complete arithmetic theories
- Propositional logics of closed and open substitutions over Heyting's arithmetic
- Some principles weaker than Markov's principle
This page was built for publication: Markov's rule revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277259)