Markov's rule revisited
From MaRDI portal
Publication:2277259
DOI10.1007/BF01634982zbMATH Open0725.03042MaRDI QIDQ2277259FDOQ2277259
Authors: Daniel M. Leivant
Publication date: 1990
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Recommendations
intuitionistic theoriesMarkov's PrincipleHeyting Arithmetic extended with transfinite induction over all recursive well-orderingsMarkov's Rule
First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50) Other constructive mathematics (03F65) Intuitionistic mathematics (03F55)
Cites Work
Cited In (7)
- Propositional logics of closed and open substitutions over Heyting's arithmetic
- The independence of Markov's principle in type theory
- Some principles weaker than Markov's principle
- Title not available (Why is that?)
- The independence of Markov's principle in type theory
- Title not available (Why is that?)
- Arithmetic complexity of the predicate logics of certain complete arithmetic theories
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)