The monadic second-order logic of graphs. IV: Definability properties of equational graphs

DOI10.1016/0168-0072(90)90027-YzbMath0731.03006OpenAlexW1480506611MaRDI QIDQ807611

No author found.

Publication date: 1990

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(90)90027-y

zbMATH Keywords

equational graphmonadic second-order logic of countable graphs

Mathematics Subject Classification ID

Related Items (14)

Automatic graphs and D0L-sequences of finite graphs ⋮ Simple monadic theories and partition width ⋮ The monadic second-order logic of graphs, II: Infinite graphs of bounded width ⋮ Querying probabilistic business processes for sub-flows ⋮ The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues ⋮ Deciding the isomorphism problem in classes of unary automatic structures ⋮ The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability ⋮ Automorphism groups of context-free graphs ⋮ The monadic second-order logic of graphs. IX: Machines and their behaviours ⋮ Infinite hypergraphs. II: Systems of recursive equations ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width ⋮ Infinite hypergraphs. I: Basic properties ⋮ \(L(A)=L(B)\)? decidability results from complete formal systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamental properties of infinite trees
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Least fixed point of a functor
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• The monadic theory of order
• Infinite hypergraphs. I: Basic properties
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Weak Second‐Order Arithmetic and Finite Automata
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width
• An axiomatic approach to the Korenjak-Hopcroft algorithms
• Graph expressions and graph rewritings
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: The monadic second-order logic of graphs. IV: Definability properties of equational graphs