Conjecture on arithmetic complexity of theories of existentially closed II_1 factors
Statement
An embeddable tracial von Neumann algebra is one that embeds into an ultrapower of the hyperfinite II factor . An existentially closed (e.c.) II factor is an existentially closed model in the relevant theory, and means that Turing reduces to .
Arithmetic-complexity conjecture. First-order arithmetic Turing reduces to the theory of any (embeddable) e.c. II factor.
The source recalls the analogous result for any e.c. group. It presents the II-factor statement as a conjecture, and relates the embeddable case to the theory of the hyperfinite II factor.
Record
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.