Natural factors of the Medvedev lattice capturing IPC
From MaRDI portal
Publication:481874
DOI10.1007/S00153-014-0393-8zbMath1338.03079arXiv1311.2010OpenAlexW3104580992MaRDI QIDQ481874
Publication date: 15 December 2014
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.2010
Logical aspects of lattices and related structures (03G10) Other degrees and reducibilities in computability and recursion theory (03D30) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (2)
First-order logic in the Medvedev lattice ⋮ Comparing the degrees of enumerability and the closed Medvedev degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Natural factors of the Muchnik lattice capturing IPC
- Intuitionistic logic and Muchnik degrees
- Characterizing the join-irreducible Medvedev degrees
- The Medvedev lattice of computably closed sets
- Intermediate logics and factors of the Medvedev lattice
- Realizability. An introduction to its categorical side
- A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice
- Classical recursion theory. The theory of functions and sets of natural numbers
- Finite groups whose maximal subgroups of Sylow \(p\)-subgroups admit a \(p\)-solvable supplement.
- The upper semi-lattice of degrees of recursive unsolvability
- On closed elements in closure algebras
- A Survey of Mučnik and Medvedev Degrees
- Algorithmic Randomness and Complexity
- Degrees joining to 0′
- Distributive Initial Segments of the Degrees of Unsolvability
- Some theorems about the sentential calculi of Lewis and Heyting
- On the interpretation of intuitionistic number theory
This page was built for publication: Natural factors of the Medvedev lattice capturing IPC