Pseudo-trees and Boolean algebras (Q1198482): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q914663 |
||
| Property / reviewed by | |||
| Property / reviewed by: Eva Copláková-Hartová / rank | |||
Revision as of 07:36, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pseudo-trees and Boolean algebras |
scientific article |
Statements
Pseudo-trees and Boolean algebras (English)
0 references
16 January 1993
0 references
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.
0 references
interval algebra
0 references
pseudo-tree algebras
0 references
Boolean algebras
0 references
