ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An embeddable tracial von Neumann algebra is one that embeds into an ultrapower of the hyperfinite II1_1 factor R\mathcal R. An existentially closed (e.c.) II1_1 factor is an existentially closed model in the relevant theory, and A≤TBA\leq_T B means that AA Turing reduces to BB.

Arithmetic-complexity conjecture. First-order arithmetic Turing reduces to the theory of any (embeddable) e.c. II1_1 factor.

The source recalls the analogous result for any e.c. group. It presents the II1_1-factor statement as a conjecture, and relates the embeddable case to the theory of the hyperfinite II1_1 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.