The complexity of isomorphism for complete theories of linear orders with unary predicates (Q527333)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of isomorphism for complete theories of linear orders with unary predicates |
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
0 references
