Interval orders, semiorders and ordered groups

From MaRDI portal
Publication:2332813

DOI10.1016/J.JMP.2019.01.002zbMATH Open1423.06056arXiv1706.03276OpenAlexW2963502671WikidataQ128491116 ScholiaQ128491116MaRDI QIDQ2332813FDOQ2332813


Authors: Maurice Pouzet, Imed Zaguia Edit this on Wikidata


Publication date: 5 November 2019

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Abstract: We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection mathcalJ of intervals of some totally ordered abelian group, these intervals being of the form [x,x+alpha[ for some positive alpha. We describe ordered groups such that the ordering is a semiorder and we introduce threshold groups generalizing totally ordered groups. We show that the free group on finitely many generators and the Thompson group mathbbF can be equipped with a compatible semiorder which is not a weak order. On another hand, a group introduced by Clifford cannot.


Full work available at URL: https://arxiv.org/abs/1706.03276




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Interval orders, semiorders and ordered groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332813)