What a computable nonforking section computes
Statement
Question 8. Does the existence of a computable section give other computable information for other characterizations of stability?
1.4. κ+-computable categoricity (Knight). Definition. Let κ be a cardinal. Then a set is κ+-recursively enu-merable when it is Σ1 on Lκ+.
Definition. K is relatively κ+-categorical when for any two κ+-computable N, M of cardinality κ+, they are isomorphic in
Lκ+ (M, N ).COMPUTABLE STABILITY THEORY PROBLEM SESSION 3
Recall that when an AEC is quasiminimal excellent, it is κ-categorical for all uncountable κ.
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.