Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present axiomatizations of the monadic second-order logic (MSO), monadic tr...
| الحاوية / القاعدة: | Logical Methods in Computer Science |
|---|---|
| المؤلفون الرئيسيون: | , |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
Logical Methods in Computer Science e.V.
2012-10-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://lmcs.episciences.org/1017/pdf |