Abstract | ||
---|---|---|
We characterize complete Boolean algebras with dense subtrees. The main results show that a complete Boolean algebra contains a dense tree if its generic filter collapses the algebra's density to its distributivity number and the reverse holds for homogeneous algebras. (c) 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1002/malq.200510033 | MATHEMATICAL LOGIC QUARTERLY |
Keywords | Field | DocType |
Boolean algebras,trees | Interior algebra,Stone's representation theorem for Boolean algebras,Discrete mathematics,Combinatorics,Boolean algebras canonically defined,Parity function,Boolean algebra,Two-element Boolean algebra,Complete Boolean algebra,Mathematics,Free Boolean algebra | Journal |
Volume | Issue | ISSN |
52 | 3 | 0942-5616 |
Citations | PageRank | References |
1 | 0.43 | 1 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bernhard König | 1 | 44 | 5.84 |