The Medvedev lattice of computably closed sets

DOI10.1007/s00153-005-0278-yzbMath1090.03010OpenAlexW1986089430MaRDI QIDQ818514

Sebastiaan A. Terwijn

Publication date: 21 March 2006

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-005-0278-y

zbMATH Keywords

intuitionistic propositional logicMedvedev reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Intermediate logics (03B55)

Related Items

A Survey of Mučnik and Medvedev Degrees ⋮ Natural factors of the Muchnik lattice capturing IPC ⋮ Basic subtoposes of the effective topos ⋮ Effectively closed mass problems and intuitionism ⋮ Binary subtrees with few labeled paths ⋮ Natural factors of the Medvedev lattice capturing IPC ⋮ Topological aspects of the Medvedev lattice ⋮ Constructive logic and the Medvedev lattice ⋮ Kripke models, distributive lattices, and Medvedev degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embeddings into the Medvedev and Muchnik lattices of \(\Pi^0_1\) classes
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• Density of the Medvedev lattice of \(\Pi^0_1\) classes
• Embedding Brouwer algebra in the Medvedev lattice
• Constructive logic and the Medvedev lattice
• Countable retracing functions and \(\Pi_2^0\) predicates
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Some Quotient Lattices of the Medvedev Lattice
• Some remarks on the algebraic structure of the Medvedev Lattice
• A splitting theorem for the Medvedev and Muchnik lattices
• ∏ 0 1 Classes and Degrees of Theories