The complexity of isomorphism for complete theories of linear orders with unary predicates (Q527333): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of isomorphism for complete theories of linear orders with unary predicates |
scientific article |
Statements
The complexity of isomorphism for complete theories of linear orders with unary predicates (English)
0 references
11 May 2017
0 references
Borel complexity
0 references
linear orders
0 references
back-and-forth equivalence
0 references
Borel completeness
0 references
