We are studying a partial order P with the following specific properties:
- P is countably infinite.
- There are infinitely many isolated elements (not comparable to any other element).
- Every chain is finite.
- There is a grading g: P -> N_0 (natural numbers), such that
- x < y implies g(x) < g(y)
- if y covers x (y > x, and nothing between), then g(y) = g(x) + 1.
- If x <= y, then the interval [x,y] is isomorphic to the powerset of g(y) - g(x) elements (and the subset-relation).
We can't find such partial orders in the literature, and so we wonder whether something is known here? Especially Property 5 seems relevant.
P comes from a logical-combinatorial situation. The motivation for this question is, whether the above properties can relate our investigations to the theory of partial orders (or whether there seem to be no deeper relations)?