Countably categorical coloured linear orders

DOI10.1002/MALQ.200910005zbMATH Open1192.03007OpenAlexW2061462686MaRDI QIDQ3552391FDOQ3552391

Authors: 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

Recommendations

• Countable homogeneous coloured partial orders
• Classification of finite coloured linear orderings
• Countable 1-transitive coloured linear orderings II
• Countably complementable linear orderings
• Categorical linearly ordered structures
• Countable, 1-transitive, coloured linear orderings. I.
• Linearly ordered theories which are nearly countably categorical
• Countable homogeneous linearly ordered posets
• Orthogonal countable linear orders
• scientific article; zbMATH DE number 1827968

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Title not available (Why is that?)
• Countable 1-transitive coloured linear orderings II
• Countable homogeneous coloured partial orders
• Posets of copies of countable non-scattered labeled linear orders
• Classification of finite coloured linear orderings
• Title not available (Why is that?)
• Countable, 1-transitive, coloured linear orderings. I.
• Coloring linear orders with Rado's partial order
• The \(\aleph_{0}\)-categorical trees
• The complexity of isomorphism for complete theories of linear orders with unary predicates

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552391)