On weak filters and ultrafilters: Set theory from (and for) knowledge representation

Abstract

Abstract Weak filters were introduced by K. Schlechta in the ’90s with the aim of interpreting defaults via a generalized ‘most’ quantifier in first-order logic. They arguably represent the largest class of structures that qualify as a ‘collection of large subsets’ of a given index set $I$, in the sense that it is difficult to think of a weaker, but still plausible, definition of the concept. The notion of weak ultrafilter naturally emerges and has been used in epistemic logic and other knowledge representation (KR) applications. We provide a comprehensive exposition of weak filters and ultrafilters, comparing them with their classical counterparts that have found very important applications in logic, set theory and topology. Weak (ultra)filters capture the ‘majorities’ of social choice theory (which coincide with the commonsense understanding of a ‘large subset’) and in that respect, they outperform classical (ultra)filters in their role as ‘collections of large subsets’. Yet, they lack some of the elegant properties of classical (ultra)filters that make them an almost perfect match for logical theories. We investigate the extent to which some important classical results carry through in this new setting, and we focus on genuinely weak filters and genuinely weak ultrafilters. For weak ultrafilters, we proceed to provide concrete examples, answer questions of existence and characterize their construction. The class of weak (ultra)filters represents a genuine contribution of KR to set theory that might be of some interest to set theorists too and we initiate this study by providing a glimpse on natural set-theoretic questions.