Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/337878 
Year of Publication: 
2026
Citation: 
[Journal:] Mathematical Social Sciences [ISSN:] 1879-3118 [Volume:] 140 [Article No.:] 102516 [Publisher:] Elsevier [Place:] Amsterdam [Year:] 2026 [Pages:] 1-7
Publisher: 
Elsevier, Amsterdam
Abstract: 
In this paper, we provide a constructive proof for threshold representations of partial orderings in a finite setting and extend the construction to arbitrary sets. This contributes to a long-standing open problem posed in Nakamura (2002) and Aleskerov et al. (2007). We identify and discuss aspects of our proof that do not directly generalize to an infinite setting and, for each, provide intuitive sufficient conditions.
Subjects: 
Incompleteness
Partial orderings
Numerical representation
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.