{'fraction_non_alphanumeric': 0.02544529262086514, 'fraction_numerical': 0.0, 'mean_word_length': 4.621428571428571, '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}}
Searching for the roots of non-contradiction and excluded-middle

This paper tries to obtain frameworks in which one can prove as theorems, and with few assumptions, the laws of non-contradiction (NC) and excluded-middle (EM), for a large class of very general systems including orthocomplemented and De Morgan lattices, as well as the theories of L -fuzzy sets. Its goal is nothing else than to begin with a search for the algebraic roots of these laws. For such a goal, and similarly to ancient Aristotelian logic, the laws are referred to self-contradiction and not to falsity as it is done in modern logics. It is additionally shown that there are some structures where it is possible to find special operations that separate those operations that verify NC from those verifying EM.