Pages that link to "Item:Q2266723"
From MaRDI portal
The following pages link to A theory of recursive dimension of ordered sets (Q2266723):
Displaying 22 items.
- A subexponential upper bound for the on-line chain partitioning problem (Q276436) (← links)
- Minors and dimension (Q345115) (← links)
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes (Q579241) (← links)
- On the theory of the PTIME degrees of the recursive sets (Q751819) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- The strong selection property and ordered sets of finite length (Q795069) (← links)
- Fundamentals of planar ordered sets (Q1086596) (← links)
- On the dimensions of ordered sets of bounded degree (Q1109797) (← links)
- An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
- On the strength of König's duality theorem for infinite bipartite graphs (Q1193566) (← links)
- On-line chain partitions of orders (Q1392205) (← links)
- Order relations of measures when avoiding decreasing sets. (Q1423072) (← links)
- On-line version of Rabinovitch theorem for proper intervals (Q1761461) (← links)
- On-line dimension for posets excluding two long incomparable chains (Q1943697) (← links)
- The graph of critical pairs of a crown (Q2279688) (← links)
- On-line dimension of semi-orders (Q2376894) (← links)
- Theory of Dimension for Large Discrete Sets and Applications (Q2933100) (← links)
- (Q3809840) (← links)
- (Q3992358) (← links)
- (Q4004146) (← links)
- A generalization of the Keisler‐Morley theorem to recursively saturated ordered structures (Q5293198) (← links)
- Improved lower bounds on the on-line chain partitioning of posets of bounded dimension (Q6139864) (← links)
