Coordinate systems can be thought of as families of (often real-valued) functions able to specify ``points in a space in some way. If the functions are set-valued, then it may still be the case that they are able to ``separate points or subsets sufficiently to allow their ``numerical characterization. Such characterizations may be useful in applications where it is important to know that a given set of scales (i.e., the functions doing the characterizing) is indeed able to separate points or subsets adequately. In this paper subsets \(P\) of Cartesian products \(A\times X\) of non-empty sets \(A\) and \(X\) are considered, with pairs of maps \(F:A\to J(\downarrow)\) and \(\widehat F:A\to J(\uparrow)\) such that for all \((a,x)\in A\times X\), \((a,x)\in P \Leftrightarrow F(a)\cap \widehat F(x)= \emptyset\) or \(F:A\to J(\downarrow)\), \(G:A \to J(\downarrow)\) such that for all \((a,x)\in A\times X\), \((a,x)\in P \Leftrightarrow F(a) \subset G(x)\). These real-interval representations have been looked at in the past and are important especially when \(A=X\) and the resulting relations represent types of order, e.g., biorders, interval orders and semiorders, for which necessary and sufficient conditions of representability in these ways are considered in considerable detail in this interesting follow up to some well-established theory.
- Numerical representations of interval orders
- Numerical representation of semiorders
- Continuous representations of interval orders based on induced preorders
- Numerical representation of interval orders on a topological space
- On relationships between numerical representations of interval orders and semiorders
- A representation of acyclic preferences
- Betweenness, orders and interval graphs
- Bilinear utility and a threshold structure for nontransitive proferences
- Composite measurement
- Foundational aspects of theories of measurement
- Interval choice: Classic and general cases
- Interval models for comparative probability on finite sets
- Interval representations for interval orders and semiorders
- Intransitive indifference with unequal indifference intervals
- On JND representations of semiorders
- On realizable biorders and the biorder dimension of a relation
- On the separation of two relations by a biorder or a semiorder
- Preference structures and threshold models
- Semiorders and a Theory of Utility Discrimination
- Some representation problems for semiorders
- Threshold models for comparative probability on finite sets
- Generalized homothetic biorders
- Semimetric thresholds for finite posets
- Preferences for multi-attributed alternatives: traces, dominance, and numerical representations
- Continuous representations of interval orders by means of two continuous functions
- Unit representation of semiorders. II: The general case
- Some results on biordered structures, in particular distributed systems
- Universal semiorders
- Weakened transitive rationality: invariance of numerical representations of preferences
- A Note on Candeal and Induráin’s Semiorder Separability Condition
- Chain representations of nested families of biorders
- Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
- Biorders with frontier
- An approach to distributed systems from orderings and representability
- Bi-semiorders with frontiers on finite sets
This page was built for publication: Real interval representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696944)
