Lexicographic behaviour of chains
From MaRDI portal
Publication:1291138
DOI10.1007/S000130050315zbMATH Open0924.06001OpenAlexW2066211746MaRDI QIDQ1291138FDOQ1291138
Authors: Esteban Induraín, Juan C. Candeal
Publication date: 30 June 1999
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s000130050315
Recommendations
lexicographic productutility functionslexicographic decompositionnumerical representations of chainsplanar chain
Cited In (15)
- 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
- Pointwise Debreu lexicographic powers
- Title not available (Why is that?)
- Numerical representability of semiorders
- UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS
- Lexicographic decomposition of chains and the concept of a planar chain
- The representability number of a chain
- Title not available (Why is that?)
- Lexicographic preference representation: intrinsic length of linear orders on infinite sets
- Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result.
- 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)