Admissible rules for logics containing S4.3
From MaRDI portal
Recommendations
Cites work
Cited in
(14)- A tableau method for checking rule admissibility in S4
- Decidability of the admissibility problem in layer-finite logics
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
- Almost structural completeness; an algebraic approach
- An admissibility criterion for inference rules with metavariables in the modal logic S4\(.\alpha_N\)
- Admissibility of logical inference rules
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- Logical equations and admissible rules of inference with parameters in modal provability logics
- Equations in free topoboolean algebra
- Deciding active structural completeness
- Modal consequence relations extending S4.3: an application of projective unification
- Semantic admissibility criteria for deduction rules in S4 and Int
- Almost structurally complete infinitary consequence operations extending \(\mathbf{S4.3}\)
This page was built for publication: Admissible rules for logics containing S4.3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068809)