Prest's decidability conjecture for theories of modules over finite-dimensional algebras
Statement
Let be a finite-dimensional algebra over a suitably recursive field. The theory of -modules is the collection of first-order sentences in the language of -modules that are true in all -modules. Prest's conjecture. The theory of -modules is decidable if and only if is of tame representation type. This conjecture proposes a converse to known decidability results for tame algebras and would characterize tameness through the decidability of the common theory of modules; the source gives no resolution.
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.