{'fraction_non_alphanumeric': 0.03994490358126722, 'fraction_numerical': 0.0013774104683195593, 'mean_word_length': 3.7516339869281046, 'pattern_counts': {'":': 0, '<': 2, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Descendingly Incomplete Ultrafilters and the Cardinality of Ultrapowers

Let D be an ultrafilter on I, and let k be a cardinal. D is said to be k-descendingly incomplete (k-d.i.) if there exists a chain Xα : α < k of elements of D such that α < β → Xα ⊆ Xβ and Xα = ϕ. Such a chain will be called a k-chain for D. The notion of k-descending incompleteness is due to Chang [3]. In this paper we explore the relationship between the cardinality of the ultrapower kI/D and the existence of certain chains on D. Since we deal so much with questions of size, we do not ordinarily make a notational distinction between a set and its cardinality. Where such a distinction is useful, the cardinality of a set A will be denoted by |A|.