Titlebook: Cardinal Functions on Boolean Algebras; J. Donald Monk Book 1990 Springer Basel AG 1990 algebra.Boolean algebra.cardinal function.function

bradycardia

書(shū)目名稱Cardinal Functions on Boolean Algebras影響因子(影響力)




書(shū)目名稱Cardinal Functions on Boolean Algebras影響因子(影響力)學(xué)科排名




書(shū)目名稱Cardinal Functions on Boolean Algebras網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Cardinal Functions on Boolean Algebras網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Cardinal Functions on Boolean Algebras被引頻次




書(shū)目名稱Cardinal Functions on Boolean Algebras被引頻次學(xué)科排名




書(shū)目名稱Cardinal Functions on Boolean Algebras年度引用




書(shū)目名稱Cardinal Functions on Boolean Algebras年度引用學(xué)科排名




書(shū)目名稱Cardinal Functions on Boolean Algebras讀者反饋




書(shū)目名稱Cardinal Functions on Boolean Algebras讀者反饋學(xué)科排名

Munificent

Stricture

Cardinality,.. = 2. for A satisfying CSP. W. Just [88] has shown that it is consistent to have a BA . such that ω. ≤ Card.. = |.| < 2ω. Questions about Card. are connected to some problems about cofinality and related cardinal functions which will not be considered here; see van Douwen [89]. The cardinal function Card. is defined as follows:

thalamus

Character,. ∈ . and ... = 0 for . ? .. Then . is the set of all.such that .. ≤ . for some cofinite subset . of .. So, it is clear that . ≤ .|. If . is a set of generators for . with |.| < |.|, then there is a . ∈ . such that . ? .. for infinitely many cofinite subsets . of .; this is clearly impossible.

neutralize

愛(ài)國(guó)者

愛(ài)國(guó)者

https://doi.org/10.1007/978-981-99-7879-3of . such that . ? .. But it is a very elementary exercise to show that no ultrafilter is included in a finite union of other, different, ultrafilters. So, t. ≥ ., and hence t. ≥ . for every infinite BA ..

LAP

,-Weight, . with π . < π ., and if we take . = . and . = ./Fin, then π . = ω; while π . = 2. since A has a disjoint subset of size 2.. Turning to products, we have (math) for any system (.. : . ∈ .) of infinite BA’s. For, ≥ is clear; now suppose .. is a dense subset of .. for each . ∈ ..

anchor

graphy

Tightness,of . such that . ? .. But it is a very elementary exercise to show that no ultrafilter is included in a finite union of other, different, ultrafilters. So, t. ≥ ., and hence t. ≥ . for every infinite BA ..