COMPARING TWO VERSIONS OF THE REALS

DOI10.1017/jsl.2015.77zbMath1371.03051OpenAlexW2517718905MaRDI QIDQ2976382

Gregory Igusa, Julia F. Knight

Publication date: 28 April 2017

Published in: The 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)

Related Items (4)

EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER ⋮ Complexity profiles and generic Muchnik reducibility ⋮ Generic Muchnik reducibility and presentations of fields ⋮ COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS

Cites Work

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

This page was built for publication: COMPARING TWO VERSIONS OF THE REALS