Cardinality Quantifiers in MLO over Trees

DOI10.1007/978-3-642-04027-6_11zbMath1257.03062OpenAlexW2106500118MaRDI QIDQ3644744

Łukasz Kaiser, Alexander Rabinovich, Vince Bárány

Publication date: 12 November 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04027-6_11

Mathematics Subject Classification ID

Descriptive set theory (03E15) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Continuum hypothesis and Martin's axiom (03E50) Logic with extra quantifiers and operators (03C80)

Related Items

Baire Category Quantifier in Monadic Second Order Logic ⋮ Monadic Second Order Logic with Measure and Category Quantifiers

Cites Work

• Unnamed Item
• Unnamed Item
• Descriptive set theory
• The monadic theory of order
• A gap property of deterministic tree languages.
• Uniformization, choice functions and well orders in the class of trees
• Transforming structures by set interpretations
• First-order and counting theories ofω-automatic structures
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Foundations of Software Science and Computation Structures

This page was built for publication: Cardinality Quantifiers in MLO over Trees