Coding true arithmetic in the Medvedev and Muchnik degrees

DOI10.2178/JSL/1294171000MaRDI QIDQ3083139zbMATH OpenOpenAlexFDO

Authors Paul Shafer

Publication date 18 March 2011

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1294171000

zbMATH Keywords

first-order theoryMedvedev degreesMuchnik degreesreducibilitiestrue arithmetic

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Models of arithmetic and set theory (03C62) Second- and higher-order model theory (03C85) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Recommendations

• Coding true arithmetic in the Medvedev degrees of ^0_1 classes
• A survey of Mučnik and Medvedev degrees
• Interpreting true arithmetic in the theory of the r.e. truth table degrees
• Embedding and coding below a 1-generic degree
• scientific article; zbMATH DE number 517082

Cites work

• A Note on Closed Degrees of Difficulty of the Medvedev Lattice
• Embedding Brouwer algebra in the Medvedev lattice
• First-order theory of the degrees of recursive unsolvability
• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• Intermediate logics and factors of the Medvedev lattice
• Interpretability and Definability in the Recursively Enumerable Degrees
• ON SOME PROPERTIES OF THE MEDVEDEV LATTICE
• Some Quotient Lattices of the Medvedev Lattice
• Some remarks on the algebraic structure of the Medvedev Lattice
• Subsystems of second order arithmetic
• THE CALCULUS OF THE WEAK "LAW OF EXCLUDED MIDDLE"

Cited in

(11)

• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• A survey of Mučnik and Medvedev degrees
• Degrees of unsolvability: a tutorial
• Interpreting true arithmetic in the _2⁰-enumeration degrees
• THE FIRST‐ORDER THEORY OF THE c‐DEGREES
• The arithmetic and Turing degrees are not elementarily equivalent
• Coding true arithmetic in the Medvedev degrees of ^0_1 classes
• Embedding and coding below a 1-generic degree
• Minimal covers in the Weihrauch degrees
• A closed subset of Baire space not Medvedev equivalent to any closed set of Cantor space

This page was built for publication: Coding true arithmetic in the Medvedev and Muchnik degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083139)