Approximating SP-orders through total preorders: incomparability and transitivity through permutations
Sign Up to like & getrecommendations! Published in 2017 at "Quaestiones Mathematicae"
DOI: 10.2989/16073606.2017.1296901
Abstract: Abstract We study finite partial orders and the concept of indistinguishability. In particular, we focus on SP-orders. These orderings can be represented by means of Hasse diagrams and numerical labels. Since these numerical representations can… read more here.
Keywords: partial order; incomparability transitivity; total preorders; preorders incomparability ... See more keywords