The complexity of isomorphism for complete theories of linear orders with unary predicates

DOI10.1007/s00153-017-0525-zzbMath1417.03228arXiv1504.03037OpenAlexW1898301872MaRDI QIDQ527333

Richard Rast

Publication date: 11 May 2017

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.03037

zbMATH Keywords

linear ordersBorel complexityback-and-forth equivalenceBorel completeness

Mathematics Subject Classification ID

Descriptive set theory (03E15) Model theory of ordered structures; o-minimality (03C64) Model theory of denumerable and separable structures (03C15)

Related Items (3)

Characterizing the existence of a Borel complete expansion ⋮ Stationarily ordered types and the number of countable models ⋮ AROUND RUBIN’S “THEORIES OF LINEAR ORDER”

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Borel complexity of isomorphism for theories with many types
• Theories of linear order
• Borel equivalence relations induced by actions of the symmetric group
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• A Borel reductibility theory for classes of countable structures
• Countably categorical coloured linear orders
• Model Theory
• THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES
• Borel completeness of some ℵ₀-stable theories
• $ℵ_0$-categoricity of linear orderings

This page was built for publication: The complexity of isomorphism for complete theories of linear orders with unary predicates