The complexity of isomorphism for complete theories of linear orders with unary predicates (Q527333): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03C64 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03E15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6714185 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Borel complexity | |||
Property / zbMATH Keywords: Borel complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
linear orders | |||
Property / zbMATH Keywords: linear orders / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
back-and-forth equivalence | |||
Property / zbMATH Keywords: back-and-forth equivalence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Borel completeness | |||
Property / zbMATH Keywords: Borel completeness / rank | |||
Normal rank |
Revision as of 06:57, 1 July 2023
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