COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS

DOI10.1017/jsl.2016.55zbMath1429.03141OpenAlexW2601283955MaRDI QIDQ5738194

Gregory Igusa, Noah Schweber, Julia F. Knight

Publication date: 1 June 2017

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

Full work available at URL: https://semanticscholar.org/paper/083fe662a1fd24f6663d0bcdfdd8afd2a3612b68

zbMATH Keywords

ordered field of realso-minimal theorygeneric Muchnik reducibility

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Model theory of ordered structures; o-minimality (03C64) Theory of numerations, effectively presented structures (03D45)

Related Items (4)

Computable valued fields ⋮ EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER ⋮ Complexity profiles and generic Muchnik reducibility ⋮ Generic Muchnik reducibility and presentations of fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic Muchnik reducibility and presentations of fields
• Projections of semi-analytic sets
• Three red herrings around Vaught’s conjecture
• Forcing a countable structure to belong to the ground model
• COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS
• COMPARING TWO VERSIONS OF THE REALS
• Degrees of Recursively Saturated Models
• A generalization of the Tarski-Seidenberg theorem, and some nondefinability results
• Definable Sets in Ordered Structures. I
• Definable Sets in Ordered Structures. II
• Forcing isomorphism
• Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function

This page was built for publication: COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS