Interval orders and reverse mathematics
From MaRDI portal
Abstract: We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the characterization theorem for interval orders: a partial order is an interval order if and only if it does not contain . We also study proper interval orders and their characterization theorem: a partial order is a proper interval order if and only if it contains neither nor .
Recommendations
Cited in
(12)- Some remarks on a problem of J. D. Monk
- Interval orders based on weak orders
- Interval orders based on arbitrary ordered sets
- On admissible orders over closed subintervals of \([0, 1]\)
- Uniquely orderable interval graphs
- Well, better and in-between
- Reverse mathematics and initial intervals
- A partial order structure on interval orders
- A NOTE ON THE REVERSE MATHEMATICS OF THE SORITES
- scientific article; zbMATH DE number 2236640 (Why is no real title available?)
- Infinite saturated orders
- Linear orders and semiorders close to an interval order
This page was built for publication: Interval orders and reverse mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469435)