Hostname: page-component-7b7567c8c-2jgqx Total loading time: 0 Render date: 2026-11-19T08:24:45.381Z Has data issue: false hasContentIssue false

Betweenness relations and cycle-free partial orders

Published online by Cambridge University Press:  24 October 2008

J. K. Truss
Affiliation:
Department of Pure Mathematics, University of Leeds, LS2 9JT
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The intuition behind the notion of a cycle-free partial order (CFPO) is that it should be a partial ordering (X, ≤ ) in which for any sequence of points (x0, x1;…, xn–1) with n ≤ 4 such that xi is comparable with xi+1 for each i (indices taken modulo n) there are i and j with j ╪ i, i + 1 such that xj lies between xi and xi+1. As its turn out however this fails to capture the intended class, and a more involved definition, in terms of the ‘Dedekind–MacNeille completion’ of X was given by Warren[5]. An alternative definition involving the idea of a betweenness relation was proposed by P. M. Neumann [1]. It is the purpose of this paper to clarify the connections between these definitions, and indeed between the ideas of semi-linear order (or ‘tree’), CFPO, and the betweenness relations described in [1]. In addition I shall tackle the issue of the axiomatizability of the class of CFPOs.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1996