Lexicographic behaviour of chains
From MaRDI portal
Publication:1291138
Recommendations
Cited in
(17)- Topologies generated by nested collections
- Functorial equations for lexicographic products
- Definable linear orders definably embed into lexicographic orders in o-minimal structures
- The non-existence of a utility function and the structure of non-representable preference relations
- Universal semiorders
- Chain representations of nested families of biorders
- Nonstandard utilities for lexicographically decomposable orderings
- Pointwise Debreu lexicographic powers
- scientific article; zbMATH DE number 36671 (Why is no real title available?)
- Numerical representability of semiorders
- Lexicographic decomposition of chains and the concept of a planar chain
- UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS
- The representability number of a chain
- scientific article; zbMATH DE number 3882491 (Why is no real title available?)
- Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result.
- Lexicographic preference representation: intrinsic length of linear orders on infinite sets
- A survey on the mathematical foundations of axiomatic entropy: representability and 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)