First-order logic axiomatization of metric graph theory

The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Tarski's axiomatization of Euclidean geometry. We provide such an axiomatization for weakly modular graphs and their...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 993; p. 114460
Main Authors:	Chalopin, Jérémie, Changat, Manoj, Chepoi, Victor, Jacob, Jeny
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 27.04.2024 Elsevier
Subjects:	[formula omitted] games Axiomatization Betweenness Combinatorics Computational Geometry Computer Science Data Structures and Algorithms Discrete Mathematics First-order logic Mathematics Metric Geometry Metric graph theory Betweenness First-order logic Axiomatization Metric graph theory E−F games
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!