{'fraction_non_alphanumeric': 0.011655011655011656, 'fraction_numerical': 0.0, 'mean_word_length': 4.733333333333333, '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}}
A Note on Naive Set Theory in LP

Recently there has been much interest in naive set theory in nonstandard logics. This note continues this trend by considering a set theory with a general comprehension schema based on the paraconsistent logic LP. We demonstrate the nontriviality of the set theory so formulated, deduce some elementary properties of this system of sets, and also delineate some of the problems of this approach.