{'fraction_non_alphanumeric': 0.020316027088036117, 'fraction_numerical': 0.004514672686230248, 'mean_word_length': 5.0, '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}}
Weak bases for Boolean relational clones revisited

We improve an existence condition for weak bases of relational clones on finite sets. Moreover, we provide a set of singleton weak bases of Boolean relational clones different than those exhibited by Lagerkvist in [10]. We treat groups of ‘similar’ Boolean clones in a uniform manner with the goal of thereby simplifying proofs working by case distinction along the clones in Post's lattice.