Cardinality and counting quantifiers on omega-automatic structures
We investigate structures that can be represented by
omega-automata, so called omega-automatic structures, and prove
that relations defined over such structures in first-order logic
expanded by the first-order quantifiers `there exist at most
$aleph_0$ many', 'there exist finitely many' and 'there exist $k$
modulo $m$ many' are omega-regular. The proof identifies certain
algebraic properties of omega-semigroups.
As a consequence an omega-regular equivalence relation of countable
index has an omega-regular set of representatives. This implies
Blumensath's conjecture that a countable structure with an
$omega$-automatic presentation can be represented using automata
on finite words. This also complements a very recent result of
Hj"orth, Khoussainov, Montalban and Nies showing that there is an
omega-automatic structure which has no injective presentation.
$omega$-automatic presentations
$omega$-semigroups
$omega$-automata
385-396
Regular Paper
Lukasz
Kaiser
Lukasz Kaiser
Sasha
Rubin
Sasha Rubin
Vince
Bárány
Vince Bárány
10.4230/LIPIcs.STACS.2008.1360
Creative Commons Attribution-NoDerivs 3.0 Unported license
https://creativecommons.org/licenses/by-nd/3.0/legalcode