Partially ordered sets of sequences and the related Boolean algebras (Q582306)

The author considers partially ordered sets of sequences. A sequence is a function defined on finite or infinite ordinals, and \(x\leq y\) for two sequences x and y means that x is a (physical) extension of y. For every such ordered set there exists a suprema preserving isomorphism into a complete Boolean algebra, which also preserves the infima of finite subsets.