THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES

DOI10.1017/jsl.2017.17zbMath1412.03018arXiv1408.5876OpenAlexW2963191342MaRDI QIDQ4977215

Davender Singh Sahota, Richard Rast

Publication date: 3 August 2017

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

simple typesmoothnesso-minimalityBorel completenessBorel equivalence to \(F_2\)

Mathematics Subject Classification ID

Descriptive set theory (03E15) Model theory of ordered structures; o-minimality (03C64) Basic properties of first-order languages and structures (03C07) Model theory of denumerable and separable structures (03C15)

Related Items (4)

The domination monoid in o-minimal theories ⋮ Anti-classification results for groups acting freely on the line ⋮ The complexity of isomorphism for complete theories of linear orders with unary predicates ⋮ Stationarily ordered types and the number of countable models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Categorical characterizations of the natural numbers require primitive recursion
• The Borel complexity of isomorphism for theories with many types
• Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
• Well quasi-ordered sets and ideals in free semigroups and algebras
• Reverse mathematics and Peano categoricity
• Paul Gordan
• Baire categoricity and \(\Sigma_1^0\)-induction
• Antichains of monomial ideals are finite
• A Borel reductibility theory for classes of countable structures
• Omitting types in -minimal theories
• Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
• Free Group Rings
• Vaught's conjecture for o-minimal theories
• Partial realizations of Hilbert's program
• Ordinal numbers and the Hilbert basis theorem
• Definable Sets in Ordered Structures. I
• Definable Sets in Ordered Structures. II
• Model Theory
• On the strength of Ramsey's theorem without Σ₁‐induction
• TOWARD OBJECTIVITY IN MATHEMATICS

This page was built for publication: THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES