Complexity profiles and generic Muchnik reducibility

DOI10.1016/J.AIM.2023.109397MaRDI QIDQ6182774zbMATH OpenFDO

Authors Uri Andrews, Joseph S. Miller, Noah Schweber, Mariya I. Soskova

Publication date 21 December 2023

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AIM.2023.109397

zbMATH Keywords

complexity profilesgeneric Muchnik reducibilityuncountable structureswadge determinacy

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other degrees and reducibilities in computability and recursion theory (03D30) Other aspects of forcing and Boolean-valued models (03E40)

Cites work

• Comparing two versions of the reals
• Computability on computable metric spaces
• Computable structures in generic extensions
• Computing strength of structures related to the field of real numbers
• Degrees coded in jumps of orderings
• Effective model theory vs. recursive model theory
• EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
• Generic copies of countable structures
• Generic Muchnik reducibility and presentations of fields
• scientific article; zbMATH DE number 6536307 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 3275577 (Why is no real title available?)
• Infinite time computable model theory
• Local computability and uncountable structures

Cited in

(1)

• Strong reducibilities and set theory

This page was built for publication: Complexity profiles and generic Muchnik reducibility

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