Ordering events: Intervals are sufficient, more general sets are usually not necessary

DOI10.1007/BF02391703MaRDI QIDQ1921301zbMATH OpenOpenAlexWikidataFDO

Authors Alessandro Provetti

Publication date 11 August 1996

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02391703

zbMATH Keywords

interval arithmeticintervalsordering relations

Mathematics Subject Classification ID

Partial orders, general (06A06) Interval and finite arithmetic (65G30)

Review text

The author defines ordering relations between two arbitrary closed sets of real numbers and proves that these relations are equivalent to corresponding relations between the smallest intervals containing the original sets.

Recommendations

• scientific article; zbMATH DE number 6020117
• scientific article; zbMATH DE number 3916273
• On admissible orders over closed subintervals of \([0, 1]\)
• Orders on intervals over partially ordered sets: extending Allen's algebra and interval graph results.
• Ordering subsets of (partially) ordered sets: representation theorems

Cites work

• scientific article; zbMATH DE number 488523 (Why is no real title available?)
• scientific article; zbMATH DE number 755842 (Why is no real title available?)
• scientific article; zbMATH DE number 804606 (Why is no real title available?)
• scientific article; zbMATH DE number 869736 (Why is no real title available?)
• Maintaining knowledge about temporal intervals
• Towards a general theory of action and time
• Why intervals? A simple limit theorem that is similar to limit theorems from statistics

Cited in

(1)

• scientific article; zbMATH DE number 3916273 (Why is no real title available?)

This page was built for publication: Ordering events: Intervals are sufficient, more general sets are usually not necessary

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