Infinite hypergraphs. I: Basic properties

DOI10.1016/0304-3975(91)90222-NzbMath0758.05069OpenAlexW2061289584MaRDI QIDQ1814126

Michel Bauderon

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90222-n

zbMATH Keywords

infinite hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Foundations, relations to logic and deductive systems (18A15)

Related Items

The monadic second-order logic of graphs, II: Infinite graphs of bounded width ⋮ The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues ⋮ A uniform approach to graph rewriting: The pullback approach ⋮ Automorphism groups of context-free graphs ⋮ A category-theoretical approach to vertex replacement: The generation of infinite graphs ⋮ Infinite hypergraphs. II: Systems of recursive equations ⋮ Node rewriting in graphs and hypergraphs: A categorical framework ⋮ The monadic second-order logic of graphs. IV: Definability properties of equational graphs

Cites Work

• The monadic second-order logic of graphs. IV: Definability properties of equational graphs
• Fundamental properties of infinite trees
• Some fundamental algebraic tools for the semantics of computation: II. Signed and abstract theories
• The theory of ends, pushdown automata, and second-order logic
• Least fixed point of a functor
• Infinite hypergraphs. II: Systems of recursive equations
• Categories of embeddings
• A fixpoint theorem for complete categories
• Continuous monoids and yields of infinite trees
• On frontiers of regular trees
• Graph expressions and graph rewritings
• Algebraic specification of data types: A synthetic approach
• The Category-Theoretic Solution of Recursive Domain Equations
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• An internal presentation of regular graphs by prefix-recognizable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item