On quantifier-rank equivalence between linear orders

DOI10.1016/J.IC.2009.11.006zbMath1211.03057OpenAlexW2024629887MaRDI QIDQ964492

Ryan Siders

Publication date: 22 April 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.11.006

zbMATH Keywords

decidabilityEhrenfeucht-Fraïssé gamefinite axiomatizabilitylinear ordercomplete theoriessemimodel

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Model theory of ordered structures; o-minimality (03C64) Basic properties of first-order languages and structures (03C07)

Related Items (1)

Ehrenfeucht-Fraïssé games on ordinals

Cites Work

• Unnamed Item
• Unnamed Item
• The complete finitely axiomatized theories of order are dense
• Well-orderings and finite quantifiers
• An application of games to the completeness problem for formalized theories
• On the elementary theory of inductive order
• On the elementary theory of linear order
• Generalized quantifiers and well orderings

This page was built for publication: On quantifier-rank equivalence between linear orders