Betweenness of partial orders - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) Année : 2020

Betweenness of partial orders

Résumé

We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial orders that can be reconstructed from their betweenness relations. We propose a polynomial time algorithm that tests if a finite relation is the betweenness of a partial order.
Fichier principal
Vignette du fichier
ita200028.pdf (371.49 Ko) Télécharger le fichier
Origine : Publication financée par une institution

Dates et versions

hal-03078856 , version 1 (16-12-2020)

Identifiants

Citer

Bruno Courcelle. Betweenness of partial orders. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2020, 54, pp.7. ⟨10.1051/ita/2020007⟩. ⟨hal-03078856⟩

Collections

CNRS
13 Consultations
46 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More