Definability in first-order theories of graph orderings ⋆

DOI10.1093/LOGCOM/EXAA017zbMATH Open1476.03039OpenAlexW3006359480MaRDI QIDQ5108031

Author name not available (Why is that?)

Publication date: 29 April 2020

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exaa017

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)

On first-order definable colorings ⋮ Segment transit function of the induced path function of graphs and its first-order definability ⋮ First-order Definable Retraction Problems for Posets and Reflexive Graphs ⋮ First-Order Definability of Trees and Sparse Random Graphs ⋮ Definability in the substructure ordering of simple graphs

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 Q5108031)