Towards an axiomatization of orderings (Q687178): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00420357 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2569299862 / rank
 
Normal rank

Latest revision as of 10:52, 30 July 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references