Dense subtrees in complete Boolean algebras

DOI10.1002/MALQ.200510033MaRDI QIDQ5485401zbMATH OpenOpenAlexFDO

Authors Bernhard König

Publication date 30 August 2006

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200510033

zbMATH Keywords

Boolean algebrastrees

Mathematics Subject Classification ID

Ordered sets and their cofinalities; pcf theory (03E04) Chain conditions, complete algebras (06E10)

Recommendations

• Dense Subsets of Products of Finite Trees
• Effectively dense Boolean algebras and their applications
• Pseudo-trees and Boolean algebras
• A Hierarchy of Algebras for Boolean Subsets
• Dense sets and embedding binary trees into hypercubes
• Boolean algebras with distinguished endomorphisms and generating trees
• scientific article; zbMATH DE number 4164927
• scientific article; zbMATH DE number 1145735
• Affine completeness of the algebra of full binary trees
• scientific article; zbMATH DE number 1389856

Cites work

• Set theory. An introduction to independence proofs

Cited in

(2)

• Base tree property
• On the Relationship between Density and Weak Density in Boolean Algebras

This page was built for publication: Dense subtrees in complete Boolean algebras

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