Natural factors of the Muchnik lattice capturing IPC
DOI10.1016/J.APAL.2013.06.001zbMATH Open1323.03056arXiv1210.6538OpenAlexW2089198308MaRDI QIDQ385809FDOQ385809
Authors: Rutger Kuyper
Publication date: 11 December 2013
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6538
Recommendations
Subsystems of classical logic (including intuitionistic logic) (03B20) Logical aspects of lattices and related structures (03G10) Other degrees and reducibilities in computability and recursion theory (03D30) Heyting algebras (lattice-theoretic aspects) (06D20)
Cites Work
- Title not available (Why is that?)
- On the interpretation of intuitionistic number theory
- On closed elements in closure algebras
- Computational randomness and lowness
- Title not available (Why is that?)
- The degrees below a 1-generic degree < 0′
- Title not available (Why is that?)
- Lowness for the Class of Schnorr Random Reals
- Some theorems about the sentential calculi of Lewis and Heyting
- Realizability. An introduction to its categorical side
- The Degrees of Hyperimmune Sets
- Classical recursion theory. Vol. II
- A survey of Mučnik and Medvedev degrees
- Degrees joining to 0′
- Title not available (Why is that?)
- Intuitionistic logic and Muchnik degrees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Medvedev lattice of computably closed sets
Cited In (2)
This page was built for publication: Natural factors of the Muchnik lattice capturing IPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385809)