COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS

DOI10.1017/jsl.2015.30zbMath1388.03042arXiv1405.7456OpenAlexW2342149294MaRDI QIDQ2976365

Noah Schweber, Antonio Montalbán, 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://arxiv.org/abs/1405.7456

zbMATH Keywords

generic Muchnik reducibilitygeneric presentabilityHarrington's theorem

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other aspects of forcing and Boolean-valued models (03E40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (9)

AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER ⋮ Forcing a countable structure to belong to the ground model ⋮ Complexity profiles and generic Muchnik reducibility ⋮ Generic Muchnik reducibility and presentations of fields ⋮ COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS ⋮ Three red herrings around Vaught’s conjecture ⋮ Unnamed Item ⋮ Characterizations of cancellable groups

Cites Work

• Unnamed Item
• Unnamed Item
• Atomic models higher up
• Bounds on weak scattering
• Representation of ideals of relational structures
• Computable structures and the hyperarithmetical hierarchy
• A model of set-theory in which every set of reals is Lebesgue measurable
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Effective Mathematics of the Uncountable

This page was built for publication: COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS