Towards an axiomatization of orderings (Q687178): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Collective rationality and dictatorship: The scope of the Arrow theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ordering pairwise comparison structures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585195 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3949052 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note—A Preference Ranking Organisation Method / rank | |||
Normal rank | |||
Revision as of 10:16, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards an axiomatization of orderings |
scientific article |
Statements
Towards an axiomatization of orderings (English)
0 references
17 October 1993
0 references
The authors propose six criteria and claim that all well-known sets of specific orderings, such as linear and weak orderings, satisfy these six axioms. These criteria impose closeness of the set of relations with respect to permutation, conversion, concatenation, restriction and substitution. Further they study minimal extensions of a given set of relations which satisfy the axioms. They introduce a sufficient condition by which it is easy to check whether a set of relations is classifiably.
0 references
ordering
0 references
axiomatization
0 references
closure properties
0 references
transitivity
0 references
weak orderings
0 references
minimal extensions of a given set of relations
0 references
