{'fraction_non_alphanumeric': 0.028735632183908046, 'fraction_numerical': 0.0, 'mean_word_length': 5.006896551724138, '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}}
Tutorial: Complexity of many-valued logics

Like in the case of classical logic and other non-standard logics, a variety of complexity-related questions can be asked in the context of many-valued logic. Some questions, such as the complexity of the sets of satisfiable and valid formulas in various logics, are completely standard; others, such as the maximal size of representations of many-valued connectives, only make sense in a many-valued context. In this overview I concentrate mainly on two kinds of complexity problems related to many-valued logics: I discuss the complexity of the membership problem in various languages, such as the satisfiable, respectively, the valid formulas in some well-known logics. Two basic proof techniques an presented in some detail: a reduction of many-valued logic to mixed integer programming and a reduction to classical logic.