Lexicographic behaviour of chains
The problem of representability of ordered sets by means of real-valued order-preserving functions is very natural in the theory of ordered sets and is important for applications. It is known that a chain is representable if and only if it is perfectly separable. The authors of the paper study more general cases of numerical representations of chains. They prove among others that any countably bounded connected chain \(Z\) admits a lexicographic decomposition as a subset of the lexicographic product \(\mathbb{R}\times Z\). Both necessary and sufficient conditions for the lack of utility functions are also discussed there.
- Pointwise Debreu lexicographic powers
- A representation for topologically separable chains
- The non-existence of a utility function and the structure of non-representable preference relations
- The representability number of a chain
- Lexicographic decomposition of chains and the concept of a planar chain
- Numerical representability of semiorders
- A survey on the mathematical foundations of axiomatic entropy: representability and orderings
- Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result.
- Topologies generated by nested collections
- Universal semiorders
- scientific article; zbMATH DE number 3882491 (Why is no real title available?)
- UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS
- scientific article; zbMATH DE number 36671 (Why is no real title available?)
- Functorial equations for lexicographic products
- Definable linear orders definably embed into lexicographic orders in o-minimal structures
- Chain representations of nested families of biorders
- Lexicographic preference representation: intrinsic length of linear orders on infinite sets
- Nonstandard utilities for lexicographically decomposable orderings
This page was built for publication: Lexicographic behaviour of chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291138)
