On quantifier-rank equivalence between linear orders
type: Item
instance of: scholarly article
title: On quantifier-rank equivalence between linear orders
zbMATH Open document ID: 1211.03057
author: Ryan Siders
published in: Information and Computation
publication date: 2010-04-22T00:00:00Z
Mathematics Subject Classification ID: 03C64
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03C07
zbMATH DE Number: 5697026
zbMATH Keywords: decidability
zbMATH Keywords: complete theories
zbMATH Keywords: finite axiomatizability
zbMATH Keywords: semimodel
zbMATH Keywords: linear order
zbMATH Keywords: Ehrenfeucht-Fraïssé game
MaRDI profile type: Publication
full work available at URL: j.ic.2009.11.006
OpenAlex ID: W2024629887
cites work: The complete finitely axiomatized theories of order are dense
cites work: Q3910512
cites work: An application of games to the completeness problem for formalized theories
cites work: Q5666547
cites work: On the elementary theory of linear order
cites work: Well-orderings and finite quantifiers
cites work: Generalized quantifiers and well orderings
cites work: On the elementary theory of inductive order
DOI: 10.1016/J.IC.2009.11.006
description: scientific article; zbMATH DE number 5697026