A finite-jump transfer from strongly minimal reducts
Statement
Conjecture 17. For any ℵ1-categorical T there is an n such that if T
has a computable model then every countable model has a presentation computable in 0(n).
Note that if T is strongly minimal then n = 4 works. 1.10. Computable prime models (Andrews).
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.