Countably categorical coloured linear orders

DOI10.1002/malq.200910005zbMath1192.03007OpenAlexW2061462686MaRDI QIDQ3552391

Feresiano Mwesigye, John K. Truss

Publication date: 15 April 2010

Published in: MLQ (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200910005

zbMATH Keywords

classificationcoloured linear orderingscolourscoding tree\(\aleph_0\)-categorical linear orderings

Mathematics Subject Classification ID

Total orders (06A05) Model theory of ordered structures; o-minimality (03C64) Categoricity and completeness of theories (03C35)

Related Items (4)

Posets of copies of countable non-scattered labeled linear orders ⋮ Classification of finite coloured linear orderings ⋮ The \(\aleph_{0}\)-categorical trees ⋮ The complexity of isomorphism for complete theories of linear orders with unary predicates

Cites Work

• Countable, 1-transitive, coloured linear orderings. I.
• Countable 1-transitive coloured linear orderings II
• $ℵ_0$-categoricity of linear orderings

This page was built for publication: Countably categorical coloured linear orders