First-Order Logic on CPDA Graphs

DOI10.1007/978-3-319-06686-8_23MaRDI QIDQ4981168zbMATH OpenOpenAlexFDO

Authors Paweł Parys

Publication date 24 June 2014

Published in Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-06686-8_23

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• On first-order logic and CPDA graphs
• The limits of decidability for first order logic on CPDA graphs
• Graph Transformations
• Positive First-order Logic on Words and Graphs
• Conceptual Graphs and First Order Logic
• On first-order conditional logics
• Compositional Diagrammatic First-Order Logic
• First-order logic on finite trees
• On the parameterized complexity of graph modification to first-order logic properties
• scientific article; zbMATH DE number 7456057

Cited in

(6)

• On first-order logic and CPDA graphs
• The limits of decidability for first order logic on CPDA graphs
• Prefix rewriting for nested-words and collapsible pushdown automata
• FO Model Checking on Nested Pushdown Trees
• First-order model checking on generalisations of pushdown graphs.
• Positive First-order Logic on Words and Graphs

This page was built for publication: First-Order Logic on CPDA Graphs

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