Best unifiers in transitive modal logics
From MaRDI portal
Publication:647403
DOI10.1007/S11225-011-9354-YzbMATH Open1247.03029OpenAlexW1973728743MaRDI QIDQ647403FDOQ647403
Publication date: 23 November 2011
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-011-9354-y
Recommendations
Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)
Cites Work
- Proof theory for admissible rules
- Best solving modal equations
- On the admissible rules of intuitionistic propositional logic
- Unification theory
- Linear Temporal Logic LTL: Basis for Admissible Rules
- Independent Bases of Admissible Rules
- Admissible Rules of Lukasiewicz Logic
- Unification in intuitionistic logic
- Admissible Rules of Modal Logics
- Unification, finite duality and projectivity in varieties of Heyting algebras
- Temporal logic and state systems
- Handbook of modal logic
- Title not available (Why is that?)
- Rules of inference with parameters for intuitionistic logic
- Unification through projectivity
- Term Rewriting and All That
- A Machine-Oriented Logic Based on the Resolution Principle
- Title not available (Why is that?)
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Unification in the description logic EL
- Unification in a Description Logic with Transitive Closure of Roles
- Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
- Computer Science Logic
- Unification of concept terms in description logics
- Unification in linear temporal logic LTL
- Linear temporal logic with until and next, logical consecutions
- Nominal Unification from a Higher-Order Perspective
- N-Prolog: An extension of Prolog with hypothetical implications. I.
- Fast algorithms for uniform semi-unification
- Logical equations and admissible rules of inference with parameters in modal provability logics
- A Tableau Method for Checking Rule Admissibility in S4
- Complexity of finite-variable fragments of EXPTIME-complete logics
Cited In (9)
- A syntactic approach to unification in transitive reflexive modal logics
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- Unifiers in transitive modal logics for formulas with coefficients (meta-variables)
- Linear step-like logic of knowledge \(\mathcal{LTK}.{sl} \)
- Unification in first-order transitive modal logic
- Unification in pretabular extensions of S4
- Filtering unification and most general unifiers in modal logic
- Projective unification in weakly transitive and weakly symmetric modal logics
- Unification and Finite Model Property for Linear Step-Like Temporal Multi-Agent Logic with the Universal Modality
This page was built for publication: Best unifiers in transitive modal logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647403)
