{'fraction_non_alphanumeric': 0.030710172744721688, 'fraction_numerical': 0.015355086372360844, 'mean_word_length': 5.069767441860465, '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}}
Non-commutative Fuzzy Logic psMTL - An Alternative Proof for the Standard Completeness Theorem

In (Jenei and Montagna, 2003) was proved that the non-commutative psMTL logic introduced in (Hájek, 2003b) is the logic of left-continuous non-commutative t-norms or, equivalently, that the logic psMTL enjoys standard completeness. In the present paper we provide an alternative proof for the standard completeness theorem for the logic psMTL and we furthermore show that this result can be obtained also for finite theories.