The evaluation of first-order substitution is monadic second-order compatible

DOI10.1016/S0304-3975(02)00012-9MaRDI QIDQ1603690zbMATH OpenFDO

Authors Teodor Knapik, Bruno Courcelle

Publication date 15 July 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00012-9

zbMATH Keywords

algebraic treedecidability of logical theoriesfirst-order substitutionhyperalgebraic treemonadic second-order logic

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Evaluation is MSOL-compatible
• scientific article; zbMATH DE number 1929935
• scientific article; zbMATH DE number 1722657
• scientific article; zbMATH DE number 219229
• Monadic second-order evaluations on tree-decomposable graphs

Cites work

• Decidability of Second-Order Theories and Automata on Infinite Trees
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Fundamental properties of infinite trees
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 1722657 (Why is no real title available?)
• scientific article; zbMATH DE number 3972168 (Why is no real title available?)
• scientific article; zbMATH DE number 3597848 (Why is no real title available?)
• scientific article; zbMATH DE number 1142319 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1456950 (Why is no real title available?)
• Monadic second-order definable graph transductions: a survey
• Monadic second-order logic, graph coverings and unfoldings of transition systems
• Program transformations and algebraic semantics
• The IO- and OI-hierarchies
• The monadic second-order logic of graphs. IX: Machines and their behaviours
• The monadic second-order logic of graphs. VII: Graphs as relational structures
• The optimal implementation of functional programming languages
• Upper bounds to the clique width of graphs

Cited in

(2)

• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Evaluation is MSOL-compatible

This page was built for publication: The evaluation of first-order substitution is monadic second-order compatible

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603690)