Complexity of admissible rules
نویسنده
چکیده
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition under which the admissibility problem is coNEXP -hard. We also show that admissibility in several well-known systems (including GL, S4, and IPC ) is in coNE , thus obtaining a sharp complexity estimate for admissibility in these systems.
منابع مشابه
Complexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic
The goal of this paper is to study the complexity of the set of admissible rules of the implication-negation fragment of intuitionistic logic IPC. Surprisingly perhaps, although this set strictly contains the set of derivable rules (the fragment is not structurally complete), it is also PSPACE-complete. This differs from the situation in the full logic IPC where the admissible rules form a co-N...
متن کاملThe complexity of admissible rules of Lukasiewicz logic
We investigate the computational complexity of admissibility of inference rules in infinite-valued Lukasiewicz propositional logic ( L). It was shown in [13] that admissibility in L is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of L are PSPACE-complete. In contrast, derivable rules of L are known to be coNP-complete.
متن کاملPreservation of Admissible Rules when Combining Logics
Admissible rules are shown to be conservatively preserved by the meetcombination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of the set of admissible rules are also shown to be preserved, the latter with no penalty on the time complexity. Examples are provided for the meet-combination ...
متن کاملRules with parameters in modal logic I
We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameterfree admissibility and unification to the setting with parameters. Specifically, we give a characterization of projective formulas generalizing Ghilardi’s characterization in the parameter-free case, leading to new proof...
متن کاملIntermediate Logics and Visser's Rules
Visser’s rules form a basis for the admissible rules of IPC. Here we show that this result can be generalized to arbitrary intermediate logics: Visser’s rules form a basis for the admissible rules of any intermediate logic L for which they are admissible. This implies that if Visser’s rules are derivable for L then L has no non-derivable admissible rules. We also provide a necessary and suffici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 46 شماره
صفحات -
تاریخ انتشار 2007