Recursion Schemes, the MSO Logic, and the U quantifier
We study the model-checking problem for recursion schemes: does the tree generated by a given higher-order recursion scheme satisfy a given logical sentence. The problem is known to be decidable for sentences of the MSO logic. We prove decidability for an extension of MSO in which we additionally ha...
| Published in: | Logical Methods in Computer Science |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2020-02-01
|
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/4885/pdf |