Uniform principal types and computable prime models
Statement
Question 19. Let T be a decidable theory having countably many countable models. What do we need to know to build a computable prime model of T? (Of course ω-stability again suffices.)
1.11. Turing degrees of DCFs (Calvert).
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.