Definability in first order theories of graph orderings

DOI10.1007/978-3-319-27683-0_23MaRDI QIDQ5283438zbMATH OpenOpenAlexFDO

Authors

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) Models of other mathematical theories (03C65) Interpolation, preservation, definability (03C40)

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

Cites work

• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 1361465 (Why is no real title available?)
• scientific article; zbMATH DE number 795221 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• A mathematical introduction to logic.
• Definability in substructure orderings. I: Finite semilattices
• Definability in substructure orderings. II: Finite ordered sets
• Definability in substructure orderings. III: Finite distributive lattices
• Definability in substructure orderings. IV: Finite lattices
• Definability in the Infix Order on Words
• Definability in the Subword Order
• Definability in the embeddability ordering of finite directed graphs
• Definability in the substructure ordering of simple graphs
• Experimental descriptive complexity
• Graph minors. XX: Wagner's conjecture
• Theories of orders on the set of words
• UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
• Undecidability of linear inequalities in graph homomorphism densities

Cited in

(14)

• Segment transit function of the induced path function of graphs and its first-order definability
• Definability in the substructure ordering of simple graphs
• On first-order definable colorings
• First-order Definable Retraction Problems for Posets and Reflexive Graphs
• Defining recursive predicates in graph orders
• Definability of recursive predicates in the induced subgraph order
• Definability in first-order theories of graph orderings
• Monadic second-order definable graph orderings
• First-Order Definability of Trees and Sparse Random Graphs
• Definability in the embeddability ordering of finite directed graphs
• Definability in the embeddability ordering of finite directed graphs. II
• Definability in the substructure ordering of finite directed graphs
• A Gandy theorem for abstract structures and applications to first-order definability
• Well-Quasi Orders and Hierarchy Theory

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)