ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finitely presented computable group. A computable dd-Σ2\Sigma_2 Scott sentence is a Scott sentence for GG that is the conjunction of a computable Σ2\Sigma_2 sentence and a computable Π2\Pi_2 sentence. Finitely presented group Scott sentence conjecture. Every finitely presented computable group GG has a computable dd-Σ2\Sigma_2 Scott sentence. This question arose because a finitely generated computable group is known to have a computable Σ3\Sigma_3 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 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.