{'fraction_non_alphanumeric': 0.022900763358778626, 'fraction_numerical': 0.003816793893129771, 'mean_word_length': 4.645161290322581, '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}}
Unification and Passive Inference Rules for Modal Logics

ABSTRACT We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. unification of formulas. A criteria is given for equivalence w.r.t. unification via existence or persistent formulas. A complete syntactic description of all formulas which are non-unifiable in wide classes of modal logics is given. Passive inference rules are considered, it is shown that in any modal logic over D4 there is a finite basis for passive rules.