Dense subtrees in complete Boolean algebras

DOI10.1002/MALQ.200510033zbMATH Open1095.03036OpenAlexW2119844137MaRDI QIDQ5485401FDOQ5485401

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

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
• scientific article; zbMATH DE number 1145735
• Affine completeness of the algebra of full binary trees
• scientific article; zbMATH DE number 1389856

zbMATH Keywords

treesBoolean algebras

Mathematics Subject Classification ID

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

Cites Work

• Set theory. An introduction to independence proofs

Cited In (1)

• Base tree property

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)