The complexity of isomorphism for complete theories of linear orders with unary predicates (Q527333): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00153-017-0525-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00153-017-0525-Z / rank | |||
Normal rank | |||
Latest revision as of 21:29, 9 December 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
0 references
