Computable structures need not admit low-Scott-rank approximations
Statement
Question 1. Is is the case that every computable structure is com-putable approximable?
Date: August 12, 2013. 1COMPUTABLE STABILITY THEORY PROBLEM SESSION 2
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.