Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
From MaRDI portal
Publication:385070
DOI10.1016/j.apal.2013.01.001zbMath1323.03029MaRDI QIDQ385070
Sergei P. Odintsov, Vladimir Vladimirovich Rybakov
Publication date: 29 November 2013
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2013.01.001
admissible inference rules; paraconsistent minimal Johanssons' logic; positive intuitionistic logic; unification problem; unifiers
Related Items
DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV, Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge, Multiple Conclusion Rules in Logics with the Disjunction Property, PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS, On rules, Admissible bases via stable canonical rules, Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation, Recognizable and perceptible logics and varieties, Temporal logic with accessibility temporal relations generated by time states themselves, Admissibility in positive logics, Subminimal negation, Strong decidability and strong recognizability, The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\), Recognizability in pre-Heyting and well-composed logics, Provability games for non-classical logics. Mezhirov game for MPC, KD!, and KD, Deductive systems with multiple-conclusion rules and the disjunction property, Inference rules in Nelson's logics, admissibility and weak admissibility, Tutorial on Admissible Rules in Gudauri
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability of the interpolation problem and of related properties in tabular logics
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Decidability of the weak interpolation property over the minimal logic
- Unification in linear temporal logic LTL
- Complexity of admissible rules
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- Constructive negations and paraconsistency
- 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
- On the admissible rules of intuitionistic propositional logic
- Construction of an Explicit Basis for Rules Admissible in Modal System S4
- Unification in the Description Logic EL
- Unification in modal and description logics
- Unification in a Description Logic with Transitive Closure of Roles
- Linear Temporal Logic LTL: Basis for Admissible Rules
- Bases of Admissible Rules of Lukasiewicz Logic
- Independent Bases of Admissible Rules
- Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
- A method of proving interpolation in paraconsistent extensions of the minimal logic
- Admissible Rules of Lukasiewicz Logic
- Rules of inference with parameters for intuitionistic logic
- One hundred and two problems in mathematical logic
- Unification in intuitionistic logic
- Unification through projectivity
- Computer Science Logic
- Admissible Rules of Modal Logics
- Unification of concept terms in description logics
