{'fraction_non_alphanumeric': 0.029197080291970802, 'fraction_numerical': 0.0, 'mean_word_length': 4.778947368421052, 'pattern_counts': {'":': 0, '<': 0, '<?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}}
Logics for multi-subset spaces

We generalize Moss and Parikh's logic of knowledge, effort, and topological reasoning, in two ways. We develop both a multi-agent and a multi-method setting for it. In each of these cases, we prove a corresponding soundness and completeness theorem, and we show that the new logics are decidable. Our methods of proof rely on those for the original system. This might have been expected, since that system is conservatively extended for the given situation. Several technical details are different nevertheless here.