Ehrenfeucht-Fraïssé games on ordinals

DOI10.1016/j.apal.2018.03.001zbMath1469.06001OpenAlexW2790064479WikidataQ59883418 ScholiaQ59883418MaRDI QIDQ2636521

Feresiano Mwesigye, John K. Truss

Publication date: 5 June 2018

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2018.03.001

zbMATH Keywords

classificationEhrenfeucht-Fraïssé gamecoloured linear ordercoloured ordinal

Mathematics Subject Classification ID

Total orders (06A05) Model theory of ordered structures; o-minimality (03C64) Basic properties of first-order languages and structures (03C07)

Related Items (4)

EHRENFEUCHT-FRAÏSSÉ GAMES ON A CLASS OF SCATTERED LINEAR ORDERS ⋮ Complexity of \(\Sigma^0_n\)-classifications for definable subsets ⋮ On optimal representatives of finite coloured linear orders ⋮ APPROXIMATING TREES AS COLOURED LINEAR ORDERS AND COMPLETE AXIOMATISATIONS OF SOME CLASSES OF TREES

Cites Work

• Unnamed Item
• Classification of finite coloured linear orderings
• On quantifier-rank equivalence between linear orders
• An application of games to the completeness problem for formalized theories
• Ehrenfeucht–Fraïssé Games on Linear Orders
• On the elementary theory of linear order

This page was built for publication: Ehrenfeucht-Fraïssé games on ordinals