Interval orders, semiorders and ordered groups
From MaRDI portal
Publication:2332813
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 of intervals of some totally ordered abelian group, these intervals being of the form for some positive . 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 can be equipped with a compatible semiorder which is not a weak order. On another hand, a group introduced by Clifford cannot.
Recommendations
- scientific article; zbMATH DE number 4049885
- scientific article; zbMATH DE number 827980
- scientific article; zbMATH DE number 1329671
- Orderable groups and semigroup compactifications
- Limits of interval orders and semiorders
- Linear orders and semiorders close to an interval order
- Certain Partial Orders on Semigroups
- A generalization of interval orders
- Orders in strict regular semigroups
- Inductive characterizations of finite interval orders and semiorders
Cites work
- scientific article; zbMATH DE number 426339 (Why is no real title available?)
- scientific article; zbMATH DE number 3935185 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 3563392 (Why is no real title available?)
- scientific article; zbMATH DE number 1344825 (Why is no real title available?)
- scientific article; zbMATH DE number 1478125 (Why is no real title available?)
- scientific article; zbMATH DE number 782634 (Why is no real title available?)
- scientific article; zbMATH DE number 3222127 (Why is no real title available?)
- A Dual of Dilworth's Decomposition Theorem
- A Noncommutative Ordinally Simple Linearly Ordered Group
- A bound on the dimension of interval orders
- An obvious proof of Fishburn's interval order theorem
- Approximating SP-orders through total preorders: incomparability and transitivity through permutations
- Biorder families, valued relations, and preference modelling
- Describing all bi-orderings on Thompson's group \(F\)
- Foundational aspects of theories of measurement
- Interval graphs and interval orders
- Intransitive indifference with unequal indifference intervals
- Introductory notes on Richard Thompson's groups
- Mathematical logic.
- Measurement structures with Archimedean ordered translation groups
- On JND representations of semiorders
- On realizable biorders and the biorder dimension of a relation
- Representations of preference orderings
- Semiorders and a Theory of Utility Discrimination
- Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
- Semiorders. Properties, representations, applications
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
- The dimension of semiorders
- The mathematics of preference, choice and order. Essays in honor of Peter C. Fishburn
- Transitiv orientierbare Graphen
- Utility Maximization, Choice and Preference
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)
