首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Dense subtrees in complete Boolean algebras
Authors:Bernhard Knig
Institution:Bernhard König
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. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Keywords:Boolean algebras  trees
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号