Expansions of MSO by cardinality relations

DOI10.2168/LMCS-9(4:18)2013zbMath1315.03042arXiv1310.8182OpenAlexW2052875987MaRDI QIDQ2871470

Alexis Bès

Publication date: 8 January 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.8182

zbMATH Keywords

monadic second-order logicdecidabilitydefinabilitycardinality relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (3)

Decidability of Definability Issues in the Theory of Real Addition ⋮ On the existential arithmetics with addition and bitwise minimum ⋮ Computations by fly-automata beyond monadic second-order logic

Uses Software

• MONA

This page was built for publication: Expansions of MSO by cardinality relations