Interval orders and reverse mathematics

dc.creatorMarcone, Alberto
dc.date2006-09-01
dc.date2007-02-21
dc.date.accessioned2026-07-07T10:19:49Z
dc.date.available2026-07-07T10:19:49Z
dc.descriptionWe 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 $2 \oplus 2$. 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 $2 \oplus 2$ nor $3 \oplus 1$.
dc.description21 pages; to appear in Notre Dame Journal of Formal Logic; minor changes from the previous version
dc.identifierhttps://arxiv.org/abs/math/0609022
dc.identifierhttp://arxiv.org/abs/math/0609022
dc.identifierNotre Dame Journal of Formal Logic 48 (2007), 425-448
dc.identifierdoi:10.1305/ndjfl/1187031412
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/174648
dc.subjectLogic
dc.subjectCombinatorics
dc.subject03B30 (primary); 06A06, 03D45 (secondary)
dc.titleInterval orders and reverse mathematics
dc.typetext

Files

Collections