Natural factors of the Muchnik lattice capturing IPC

DOI10.1016/J.APAL.2013.06.001MaRDI QIDQ385809zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

intuitionistic logicKripke modelsMuchnik degrees

Mathematics Subject Classification ID

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)

Abstract: We give natural examples of factors of the Muchnik lattice which capture intuitionistic propositional logic (IPC), arising from the concepts of lowness, 1-genericity, hyperimmune-freeness and computable traceability. This provides a purely computational semantics for IPC.

Recommendations

• Natural factors of the Medvedev lattice capturing IPC
• scientific article; zbMATH DE number 4059356
• Constructive logic and the Medvedev lattice
• Intermediate logics and factors of the Medvedev lattice
• The finite intervals of the Muchnik lattice

Cites work

• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 4059356 (Why is no real title available?)
• scientific article; zbMATH DE number 3715539 (Why is no real title available?)
• scientific article; zbMATH DE number 3501559 (Why is no real title available?)
• scientific article; zbMATH DE number 841094 (Why is no real title available?)
• scientific article; zbMATH DE number 3222132 (Why is no real title available?)
• scientific article; zbMATH DE number 3250567 (Why is no real title available?)
• scientific article; zbMATH DE number 3110190 (Why is no real title available?)
• A survey of Mučnik and Medvedev degrees
• Classical recursion theory. Vol. II
• Computational randomness and lowness
• Degrees joining to 0′
• Intuitionistic logic and Muchnik degrees
• Lowness for the Class of Schnorr Random Reals
• On closed elements in closure algebras
• On the interpretation of intuitionistic number theory
• Realizability. An introduction to its categorical side
• Some theorems about the sentential calculi of Lewis and Heyting
• The Degrees of Hyperimmune Sets
• The Medvedev lattice of computably closed sets
• The degrees below a 1-generic degree < 0′

Cited in

(2)

• Mass problems and intuitionistic higher-order logic
• Natural factors of the Medvedev lattice capturing IPC

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)