ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

On the Decomposition of Order-Separable Posets of Countable Width into Chains (1999)

Gruenhage, Gary ; Mashburn, Joe

Springer

Order 16 (1999), S. 171-177

add to mindlist on the mindlist

Details

ISSN: 1572-9273

Keywords: chain ; countable width ; k-entangled subset ; Open Coloring Axiom ; order-separable

Source: Springer Online Journal Archives 1860-2000

Topics: Mathematics

Notes: Abstract A partially ordered set X has countable width if and only if every collection of pairwise incomparable elements of X is countable. It is order-separable if and only if there is a countable subset D of X such that whenever p, q ∈ X and p 〈 q, there is r ∈ D such that p ≤ r ≤ q. Can every order-separable poset of countable width be written as the union of a countable number of chains? We show that the answer to this question is “no” if there is a 2-entangled subset of R, and “yes” under the Open Coloring Axiom.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1023/A:1006360607363

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit