A theory of recursive dimension of ordered sets

DOI10.1007/BF00396274zbMath0562.06001OpenAlexW1998185290MaRDI QIDQ2266723

George F. McNulty, William T. jun. Trotter, Henry A. Kierstead

Publication date: 1984

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

recursive setscountable ordered setsrecursive chain covering numberrecursive chainsrecursive dimension

Mathematics Subject Classification ID

Partial orders, general (06A06) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

A subexponential upper bound for the on-line chain partitioning problem, On-line dimension of semi-orders, Minors and dimension, An on-line graph coloring algorithm with sublinear performance ratio, On-line chain partitions of orders, Improved lower bounds on the on-line chain partitioning of posets of bounded dimension, On-line dimension for posets excluding two long incomparable chains, On the strength of König's duality theorem for infinite bipartite graphs, On-line version of Rabinovitch theorem for proper intervals, Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes, The graph of critical pairs of a crown, On-line chain partitions of orders: a survey

Cites Work

• A bound on the dimension of interval orders
• A decomposition theorem for partially ordered sets
• An Effective Version of Hall's Theorem
• Two-dimensional partial orderings: Recursive model theory
• An Effective Version of Dilworth's Theorem
• Partial orderings of fixed finite dimension: Model companions and density
• Recursive Euler and Hamilton Paths
• Effective coloration
• Partially Ordered Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item