Best unifiers in transitive modal logics
From MaRDI portal
Publication:647403
DOI10.1007/s11225-011-9354-yzbMath1247.03029MaRDI QIDQ647403
Vladimir Vladimirovich Rybakov
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
03B45: Modal logic (including the logic of norms)
03B35: Mechanization of proofs and logical operations
Related Items
DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV, Unification in pretabular extensions of S4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unification, finite duality and projectivity in varieties of Heyting algebras
- Unification in linear temporal logic LTL
- Logical equations and admissible rules of inference with parameters in modal provability logics
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- Linear temporal logic with until and next, logical consecutions
- Proof theory for admissible rules
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Best solving modal equations
- Temporal logic and state systems
- Fast algorithms for uniform semi-unification
- On the admissible rules of intuitionistic propositional logic
- Unification in the Description Logic EL
- Unification in a Description Logic with Transitive Closure of Roles
- Linear Temporal Logic LTL: Basis for Admissible Rules
- A Tableau Method for Checking Rule Admissibility in S4
- Independent Bases of Admissible Rules
- Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
- Admissible Rules of Lukasiewicz Logic
- N-Prolog: An extension of Prolog with hypothetical implications. I.
- Rules of inference with parameters for intuitionistic logic
- Unification in intuitionistic logic
- Unification through projectivity
- Term Rewriting and All That
- Computer Science Logic
- A Machine-Oriented Logic Based on the Resolution Principle
- Admissible Rules of Modal Logics
- Nominal Unification from a Higher-Order Perspective
- Unification of concept terms in description logics
