The complexity of isomorphism for complete theories of linear orders with unary predicates (Q527333): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00153-017-0525-z / rank
Normal rank
 
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
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1898301872 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1504.03037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Borel reductibility theory for classes of countable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel equivalence relations induced by actions of the symmetric group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel completeness of some ℵ<sub>0</sub>-stable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borel complexity of isomorphism for theories with many types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countably categorical coloured linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: $ℵ_0$-categoricity of linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories of linear order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078324 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00153-017-0525-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20: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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references