Definability in first order theories of graph orderings

DOI10.1007/978-3-319-27683-0_23zbMATH Open1476.03040OpenAlexW2406259786MaRDI QIDQ5283438FDOQ5283438

Author name not available (Why is that?)

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

Recommendations

• Definability in first-order theories of graph orderings
• Definability in the substructure ordering of simple graphs
• Definability in the embeddability ordering of finite directed graphs. II
• Monadic second-order definable graph orderings
• Defining recursive predicates in graph orders

zbMATH Keywords

graphspartial orderdefinabilitylogical theory

Mathematics Subject Classification ID

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

Cites Work

• Graph minors. XX: Wagner's conjecture
• 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
• Definability in the substructure ordering of simple graphs
• A mathematical introduction to logic.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Definability in substructure orderings. II: Finite ordered sets
• Undecidability of linear inequalities in graph homomorphism densities
• Theories of orders on the set of words
• Definability in the Infix Order on Words
• Title not available (Why is that?)
• UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
• Definability in the Subword Order
• Experimental Descriptive Complexity

Cited In (10)

• Title not available (Why is that?)
• Definability in the substructure ordering of simple graphs
• Definability of Recursive Predicates in the Induced Subgraph Order
• On first-order definable colorings
• First-order Definable Retraction Problems for Posets and Reflexive Graphs
• First-Order Definability of Trees and Sparse Random Graphs
• Definability in the embeddability ordering of finite directed graphs. II
• Definability in the substructure ordering of finite directed graphs
• Well-Quasi Orders and Hierarchy Theory
• Segment transit function of the induced path function of graphs and its first-order definability

This page was built for publication: Definability in first order theories of graph orderings

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