Computable d-Σ_2 Scott sentences for finitely presented groups
Statement
Let be a finitely presented computable group. A computable - Scott sentence is a Scott sentence for that is the conjunction of a computable sentence and a computable sentence. Finitely presented group Scott sentence conjecture. Every finitely presented computable group has a computable - Scott sentence. This question arose because a finitely generated computable group is known to have a computable Scott sentence that is optimal, while the known counterexample is not finitely presented; the paper describes evidence for a positive answer but leaves the finitely presented case open.
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.