Cardinal functions on initial chain algebras on pseudotrees

DOI10.1023/A:1006415818082MaRDI QIDQ1583843zbMATH OpenOpenAlexFDO

Authors Lynne Baur

Publication date 22 July 2001

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1006415818082

zbMATH Keywords

Boolean algebracardinal functionscellularitydepthhereditary cofinalityhereditary Lindelöf degreeincomparabilityinitial chain algebrairredundancepseudotreespreadStone spacetightness

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Structure theory of Boolean algebras (06E05) Chain conditions, complete algebras (06E10) Stone spaces (Boolean spaces) and related structures (06E15)

Review text

A pseudotree is a partially ordered set such that the collection of elements below a given element is simply ordered. Taking those collections as generators, one forms a Boolean algebra of subsets of the pseudotree, called the initial chain algebra of it. The author investigates the relationships between the following common cardinal functions in such algebras: depth, tightness, spread, hereditary Lindelöf degree, cellularity, incomparability, hereditary cofinality, cardinality, and irredundance. Several theorems show that some of these functions coincide for initial chain algebras. The results seem to be rather complete. The Stone space of such an algebra is characterized.

Recommendations

• Initial chain algebras on pseudotrees
• Cellularity of pseudo-tree algebras
• Character of pseudo-tree algebras.
• Pseudo-trees and Boolean algebras
• Cellularity and the structure of pseudo-trees

Cited in

(4)

• Initial chain algebras on pseudotrees
• Some remarks on pseudotrees
• The Mardešić Conjecture and free products of Boolean algebras
• Cellularity and the structure of pseudo-trees

This page was built for publication: Cardinal functions on initial chain algebras on pseudotrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583843)