{'fraction_non_alphanumeric': 0.015100671140939598, 'fraction_numerical': 0.0, 'mean_word_length': 4.632075471698113, '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}}
First-order axiomatization of rough mereology

In this paper, I will look into a possible first-order axiomatization of rough mereology and then show that if the domain is finite, such an axiomatization is in fact equivalent to a theory which is axiomatizable by some mereological axioms that can be found in the literature. From such a result it can be seen that any model of the theory considered forms a finite Boolean algebra. Besides, based on the same result, I will also make some observations about the conditions on a rough inclusion function which can be used to define rough mereology.