Cardinality Quantifiers in MLO over Trees
From MaRDI portal
Recommendations
- Expressing cardinality quantifiers in monadic second-order logic over trees
- Modulo-counting quantifiers over finite trees
- Tree-depth, quantifier elimination, and quantifier rank
- Expressing cardinality quantifiers in monadic second-order logic over chains
- Theory and Applications of Satisfiability Testing
- Model complete theories of trees
- Pushing the boundaries of reasoning about qualified cardinality restrictions
- scientific article; zbMATH DE number 120348
- On model-theoretic tree properties
- scientific article; zbMATH DE number 1894708
Cites work
- A gap property of deterministic tree languages.
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Descriptive set theory
- First-order and counting theories ofω-automatic structures
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 176157 (Why is no real title available?)
- scientific article; zbMATH DE number 1086492 (Why is no real title available?)
- Testing and generating infinite sequences by a finite automaton
- The monadic theory of order
- Transforming structures by set interpretations
- Uniformization, choice functions and well orders in the class of trees
Cited in
(5)- Expressing cardinality quantifiers in monadic second-order logic over chains
- Expressing cardinality quantifiers in monadic second-order logic over trees
- Baire category quantifier in monadic second order logic
- scientific article; zbMATH DE number 2038747 (Why is no real title available?)
- Monadic Second Order Logic with Measure and Category Quantifiers
This page was built for publication: Cardinality Quantifiers in MLO over Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644744)