Pseudo-trees and Boolean algebras (Q1198482): Difference between revisions

A partially ordered set \((T,\leq)\) is said to be a pseudo-tree if the initial segment \(\{x\in T:x\leq t\}\) of \(T\) is linearly ordered under \(\leq\) for every \(t\in T\). The authors consider Boolean algebras constructed in various ways from pseudo-trees and study the connection between pseudo-tree algebras and related classes of Boolean algebras.