Boolean embedding from a partially ordered structure to a boolean algebra

Abstract

We prove the following theorem.

THEOREM Let be an arbitrary partially ordered structure. Then, there is a canonical embedding (1:1order-preserving map)

such that

(i) B is a complete Boolean algebra.

(ii) (p and q are compatible )

(iii) satisfies “a small property” in the sense that; (a) If P is finite, then B is finite.

(b) If P is infinite, then for any infinite branch l in B - {0},

(c) for any minimal element a in P, e (a) becomes a minimal element in B - {0}.

Especially, when is finite, we give an algorithm called “the Normal Separativization” which realize the embedding e. As the byproduct, we obtain an interesting insight that the set of all finite partially ordered structures can be classified to categories called “Boolean compexity of the type (n,m)”, where n and m are natural numbers.

Keywords:

• Partially ordered structure
• Boolean algebra
• embedding
• algorithm