Betweenness of partial orders

04/21/2020
by   Bruno Courcelle, et al.
0

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 be-tweenness of a partial order.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2021

Partial order alignment by adjacencies and breakpoints

Linearizing two partial orders to maximize the number of adjacencies and...
research
03/25/2014

Non-characterizability of belief revision: an application of finite model theory

A formal framework is given for the characterizability of a class of bel...
research
07/30/2021

Interleaving Reconfigurable Interaction: Separating Choice from Scheduling using Glue

Reconfigurable interaction induces another dimension of nondeterminism i...
research
09/10/2019

Distorted stochastic dominance: a generalized family of stochastic orders

We study a generalized family of stochastic orders, semiparametrized by ...
research
11/30/2021

Induced betweenness in order-theoretic trees

The ternary relation B(x,y,z) of betweenness states that an element y is...
research
09/27/2018

Operations on Partial Orders

We define analogues of Boolean operations on not necessarily complete pa...
research
07/27/2014

Defining Relative Likelihood in Partially-Ordered Preferential Structures

Starting with a likelihood or preference order on worlds, we extend it t...

Please sign up or login with your details

Forgot password? Click here to reset