The representability number of a chain

DOI10.1016/J.TOPOL.2004.05.016MaRDI QIDQ1779520zbMATH OpenOpenAlexFDO

Authors Alfio Giarlotta

Publication date 1 June 2005

Published in Topology and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.topol.2004.05.016

zbMATH Keywords

Preference representationAronszajn linesLexicographic orderingRepresentability numberSouslin lines

Mathematics Subject Classification ID

Utility theory (91B16) Other combinatorial set theory (03E05) Total orders (06A05) Ordered topological structures (06F30) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05)

Recommendations

• Representable lexicographic products
• Lexicographic behaviour of chains
• Representing Embeddability as Set Inclusion
• scientific article; zbMATH DE number 4162943
• Interrelations between the length, the structure and the cardinality of a chain

Cites work

• scientific article; zbMATH DE number 3888510 (Why is no real title available?)
• scientific article; zbMATH DE number 3092668 (Why is no real title available?)
• $ℵ_0$-categoricity of linear orderings
• A representation for topologically separable chains
• Embedding linearly ordered sets in real lexicographic products
• Isomorphisms of Lexicographic Powers of the Reals
• Lexicographic behaviour of chains
• Representable lexicographic products
• Representations of preference orderings
• Set theory. An introduction to independence proofs
• The non-existence of a utility function and the structure of non-representable preference relations
• Utility Theory

Cited in

(17)

• Characterizations of standard elements in posets
• scientific article; zbMATH DE number 887775 (Why is no real title available?)
• On countably saturated linear orders and certain class of countably saturated graphs
• Debreu-like properties of utility representations
• The existence and the non-existence of utility functions in order-theoretic, algebraic and topological environments
• Implementations of PACMAN
• Universal semiorders
• The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties
• A lattice-theoretical characterization of the family of cut sets of interval-valued fuzzy sets
• Pointwise Debreu lexicographic powers
• The interplay between intergenerational justice and mathematical utility theory
• Representable lexicographic products
• Counting common representatives and symmetric chain decompositions
• A hierarchy of chains embeddable into the lexicographic power \(({\mathbb{R}}^\omega,\prec_{\text{lex}})\)
• A genesis of interval orders and semiorders: transitive NaP-preferences
• Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result.
• Lexicographic preference representation: intrinsic length of linear orders on infinite sets

This page was built for publication: The representability number of a chain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779520)