AbstractOne definition of an interval order is as an order isomorphic to that of a family of nontrivial intervals of a linearly ordered set with [a,b] < [c,d] if b ⩽ c. Fishburn's theorem states that an order is an interval order if and only if it has no four-element restriction isomorphic to the ordered set (shown in Fig. 1) “2 + 2”. We show that an order is isomorphic to a family of nontrivial intervals of a weak order, ordered as above, if and only if it has no restriction to one of the four ordered sets (shown in Fig. 2) “3 + 2”, “2 + N”, a six-element crown or a six-element fence
Abstract. We discuss bijections that relate families of chains in lattices associated to an order P ...
AbstractA two-length interval order is a partially ordered set whose points can be mapped into close...
Interval temporal logics provide a general framework for temporal reasoning about interval structure...
AbstractOne definition of an interval order is as an order isomorphic to that of a family of nontriv...
AbstractIn general, an interval order is defined to be an ordered set which has an interval represen...
AbstractThe main results of this paper are two distinct characterizations of interval orders and an ...
AbstractThis paper explores the intimate connection between finite interval graphs and interval orde...
We study the reverse mathematics of interval orders. We establish the logical strength of the implic...
Semiorders may form the simplest class of ordered sets with a not necessarily transitive indifferenc...
AbstractIn this paper we introduce a family of ordered sets we call k-weak orders which generalize w...
We provide an answer to an open problem concerning the representation of preferences by intervals. G...
This thesis examines several classes of interval orders arising from restrictions on the permissible...
AbstractWe provide an answer to an open problem concerning the representation of preferences by inte...
Article dans revue scientifique avec comité de lecture.We discuss bijections that relate families of...
To make a decision, we need to compare the values of quantities. In many practical situations, we kn...
Abstract. We discuss bijections that relate families of chains in lattices associated to an order P ...
AbstractA two-length interval order is a partially ordered set whose points can be mapped into close...
Interval temporal logics provide a general framework for temporal reasoning about interval structure...
AbstractOne definition of an interval order is as an order isomorphic to that of a family of nontriv...
AbstractIn general, an interval order is defined to be an ordered set which has an interval represen...
AbstractThe main results of this paper are two distinct characterizations of interval orders and an ...
AbstractThis paper explores the intimate connection between finite interval graphs and interval orde...
We study the reverse mathematics of interval orders. We establish the logical strength of the implic...
Semiorders may form the simplest class of ordered sets with a not necessarily transitive indifferenc...
AbstractIn this paper we introduce a family of ordered sets we call k-weak orders which generalize w...
We provide an answer to an open problem concerning the representation of preferences by intervals. G...
This thesis examines several classes of interval orders arising from restrictions on the permissible...
AbstractWe provide an answer to an open problem concerning the representation of preferences by inte...
Article dans revue scientifique avec comité de lecture.We discuss bijections that relate families of...
To make a decision, we need to compare the values of quantities. In many practical situations, we kn...
Abstract. We discuss bijections that relate families of chains in lattices associated to an order P ...
AbstractA two-length interval order is a partially ordered set whose points can be mapped into close...
Interval temporal logics provide a general framework for temporal reasoning about interval structure...