Recursion Schemes and the WMSO+U Logic
From MaRDI portal
Publication:3304152
DOI10.4230/LIPIcs.STACS.2018.53zbMath1491.03010OpenAlexW2791847152MaRDI QIDQ3304152
Publication date: 5 August 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2018.53
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Krivine machines and higher-order schemes
- Weak MSO with the unbounding quantifier
- The IO- and OI-hierarchies
- The monadic theory of order
- Unboundedness and downward closures of higher-order pushdown automata
- A Note on Decidable Separability by Piecewise Testable Languages
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- Simply typed fixpoint calculus and collapsible pushdown automata
- Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
- A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
- The first order properties of products of algebraic systems
- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
- Weak MSO+U with Path Quantifiers over Infinite Trees
- Using Models to Model-Check Recursive Schemes
- Computer Science Logic
- A model for behavioural properties of higher-order programs
- Model Checking Higher-Order Programs
- A type-directed abstraction refinement approach to higher-order model checking
- Indexed Grammars—An Extension of Context-Free Grammars
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
This page was built for publication: Recursion Schemes and the WMSO+U Logic
