Extending the WMSO+U logic with quantification over tuples
From MaRDI portal
Cites work
- A characterization for decidable separability by piecewise testable languages
- A model for behavioural properties of higher-order programs
- A type system describing unboundedness
- An approach to computing downward closures
- Collapsible pushdown automata and recursion schemes
- Computer Science Logic
- Cost automata, safe schemes, and downward closures
- Cost-parity and cost-Streett games
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decision Problems of Finite Automata Design and Related Arithmetics
- From liveness to promptness
- scientific article; zbMATH DE number 2087432 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- Indexed Grammars—An Extension of Context-Free Grammars
- Krivine machines and higher-order schemes
- Model checking higher-order programs
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Ordered tree-pushdown systems
- Recursion schemes and the WMSO+U logic
- Recursion schemes, the MSO logic, and the \textsf{U} quantifier
- Satisfiability of \(\mathrm{CTL}^{*}\) with constraints
- Simply typed fixpoint calculus and collapsible pushdown automata
- The diagonal problem for higher-order recursion schemes is decidable
- The IO- and OI-hierarchies
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Unboundedness and downward closures of higher-order pushdown automata
- Weak \(\text{MSO}+U\) over infinite trees
- Weak MSO with the unbounding quantifier
- Weak MSO+U with path quantifiers over infinite trees
This page was built for publication: Extending the WMSO+U logic with quantification over tuples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856046)
