On optimal Scott sentences of finitely generated algebraic structures
Bibliographic record
Abstract
Scott showed that for every countable structure A \mathcal {A} , there is a sentence of the infinitary logic L ω 1 ω \mathcal {L}_{\omega _1\omega } , called a Scott sentence for A \mathcal {A} , whose countable models are exactly the isomorphic copies of A \mathcal {A} . Thus, the least quantifier complexity of a Scott sentence of a structure is an invariant that measures the complexity “describing” the structure. Knight et al. have studied the Scott sentences of many structures. In particular, Knight and Saraph showed that a finitely generated structure always has a Σ 3 0 \Sigma ^0_3 Scott sentence. We give a characterization of the finitely generated structures for which the Σ 3 0 \Sigma ^0_3 Scott sentence is optimal. One application of this result is to give a construction of a finitely generated group where the Σ 3 0 \Sigma ^0_3 Scott sentence is optimal.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.004 | 0.009 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.008 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".