38,159 research outputs found

    Undecidability of the unification and admissibility problems for modal and description logics

    Full text link
    We show that the unification problem `is there a substitution instance of a given formula that is provable in a given logic?' is undecidable for basic modal logics K and K4 extended with the universal modality. It follows that the admissibility problem for inference rules is undecidable for these logics as well. These are the first examples of standard decidable modal logics for which the unification and admissibility problems are undecidable. We also prove undecidability of the unification and admissibility problems for K and K4 with at least two modal operators and nominals (instead of the universal modality), thereby showing that these problems are undecidable for basic hybrid logics. Recently, unification has been introduced as an important reasoning service for description logics. The undecidability proof for K with nominals can be used to show the undecidability of unification for boolean description logics with nominals (such as ALCO and SHIQO). The undecidability proof for K with the universal modality can be used to show that the unification problem relative to role boxes is undecidable for Boolean description logic with transitive roles, inverse roles, and role hierarchies (such as SHI and SHIQ)

    Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus

    Get PDF
    AbstractQuestions connected with the admissibility of rules of inference and the solvability of the substitution problem for modal and intuitionistic logic are considered in an algebraic framework. The main result is the decidability of the universal theory of the free modal algebra Fω(Grz) extended in signature by adding constants for free generators. As corollaries we obtain: (a) there exists an algorithm for the recognition of admissibility of rules with parameters (hence also without them) in the modal system Grz, (b) the substitution problem for Grz and for the intuitionistic calculus H is decidable, (c) intuitionistic propositional calculus H is decidable with respect to admissibility (a positive solution of Friedman's problem). A semantical criterion for the admissibility of rules of inference in Grz is given

    The Complexity of Admissibility in Omega-Regular Games

    Full text link
    Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games played on graphs with omega-regular objectives. In this paper, we study the algorithmic properties of this concept for such games. We settle the exact complexity of natural decision problems on the set of strategies that survive iterated elimination of dominated strategies. As a byproduct of our construction, we obtain automata which recognize all the possible outcomes of such strategies

    Structural completeness in propositional logics of dependence

    Full text link
    In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of substitutions under which the logics are closed. We obtain an analogues result with respect to stable substitutions, for the negative variants of some well-known intermediate logics, which are intermediate theories that are closely related to inquisitive logic

    Multiple Conclusion Rules in Logics with the Disjunction Property

    Full text link
    We prove that for the intermediate logics with the disjunction property any basis of admissible rules can be reduced to a basis of admissible m-rules (multiple-conclusion rules), and every basis of admissible m-rules can be reduced to a basis of admissible rules. These results can be generalized to a broad class of logics including positive logic and its extensions, Johansson logic, normal extensions of S4, n-transitive logics and intuitionistic modal logics
    • …
    corecore