Comparing two versions of the reals

DOI10.1017/JSL.2015.77MaRDI QIDQ2976382zbMATH OpenOpenAlexFDO

Authors Gregory Igusa, J. F. Knight

Publication date 28 April 2017

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

Full work available at URL https://doi.org/10.1017/jsl.2015.77

zbMATH Keywords

computabilityuncountable structures

Mathematics Subject Classification ID

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

Recommendations

• Computing strength of structures related to the field of real numbers
• Relative randomness and real closed fields
• Complexity of structures associated with real closed fields
• Reducts of some structures over the reals
• Generic Muchnik reducibility and presentations of fields

Cites work

• Complexity of structures associated with real closed fields
• Computable structures and the hyperarithmetical hierarchy
• Generic copies of countable structures
• Set theory. An introduction to independence proofs

Cited in

(5)

• Relative randomness and real closed fields
• Generic Muchnik reducibility and presentations of fields
• Computing strength of structures related to the field of real numbers
• EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
• Complexity profiles and generic Muchnik reducibility

This page was built for publication: Comparing two versions of the reals

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