The following pages link to Lexicographic behaviour of chains (Q1291138):
Displaying 15 items.
- Topologies generated by nested collections (Q262972) (← links)
- Universal semiorders (Q313082) (← links)
- Nonstandard utilities for lexicographically decomposable orderings (Q745010) (← links)
- Pointwise Debreu lexicographic powers (Q1047189) (← links)
- A representation for topologically separable chains (Q1320219) (← links)
- The non-existence of a utility function and the structure of non-representable preference relations (Q1611765) (← links)
- The representability number of a chain (Q1779520) (← links)
- Lexicographic decomposition of chains and the concept of a planar chain (Q1850145) (← links)
- Numerical representability of semiorders (Q1867801) (← links)
- A survey on the mathematical foundations of axiomatic entropy: representability and orderings (Q2305843) (← links)
- Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result. (Q2510075) (← links)
- UNIVERSAL CODOMAINS TO REPRESENT INTERVAL ORDERS (Q3629766) (← links)
- Numerical representation of totally ordered sets (Q3991242) (← links)
- Definable linear orders definably embed into lexicographic orders in o-minimal structures (Q4910795) (← links)
- Lexicographic preference representation: intrinsic length of linear orders on infinite sets (Q6170023) (← links)