Definability in First Order Theories of Graph Orderings

DOI10.1007/978-3-319-27683-0_23zbMath1476.03040OpenAlexW2406259786MaRDI QIDQ5283438

No author found.

Publication date: 21 July 2017

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

graphspartial orderdefinabilitylogical theory

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Interpolation, preservation, definability (03C40) Models of other mathematical theories (03C65)

Related Items (5)

Unnamed Item ⋮ Definability in the substructure ordering of finite directed graphs ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Definability of Recursive Predicates in the Induced Subgraph Order ⋮ Definability in the embeddability ordering of finite directed graphs. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability in the substructure ordering of simple graphs
• Graph minors. XX: Wagner's conjecture
• Definability in substructure orderings. II: Finite ordered sets
• Definability in substructure orderings. I: Finite semilattices
• Definability in substructure orderings. IV: Finite lattices
• Definability in substructure orderings. III: Finite distributive lattices
• Definability in the embeddability ordering of finite directed graphs
• Experimental Descriptive Complexity
• Theories of orders on the set of words
• Definability in the Subword Order
• Definability in the Infix Order on Words
• UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
• Undecidability of linear inequalities in graph homomorphism densities

This page was built for publication: Definability in First Order Theories of Graph Orderings