Scott sentences for equivalence structures (Q2309506)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7184242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scott sentences for equivalence structures |
scientific article; zbMATH DE number 7184242 |
Statements
Scott sentences for equivalence structures (English)
0 references
1 April 2020
0 references
The author gives an example of an equivalence structure for which the index set is \(m\)-complete \(\Pi_3^0\) but for which there is no computable \(\Pi_3\) Scott sentence. It follows from the author's result that if a computable equivalence structure with infinitely many infinite equivalence classes and with arbirarily large finite classes satisfies a \(\Sigma_4\) sentence \(\varphi\) then it has a substructure with finitely many infinite classes satisfying the same sentence \(\varphi\).
0 references
index sets
0 references
Scott sentences
0 references
equivalence structures
0 references
0 references
0 references
0 references
0.82851624
0 references
0 references
0 references
0.8096521
0 references
0.80908346
0 references
0.80887043
0 references
