ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
From MaRDI portal
Cited in
(19)- Decidability of the admissibility problem in layer-finite logics
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Bases of admissible rules of the logics S4 and Int
- Admissible rules for pretable modal logics
- Admissibility in positive logics
- Hereditarily structurally complete superintuitionistic deductive systems
- Characteristic inference rules
- Hereditarily structurally complete intermediate logics: Citkin's theorem via duality
- Admissibility and refutation: some characterisations of intermediate logics
- Hereditarily structurally complete modal logics
- Finite frames fail: how infinity works its way into the semantics of admissibility
- The context of inference
- Characteristic formulas over intermediate logics
- Logical consecutions in discrete linear temporal logic
- Yankov Characteristic Formulas (An Algebraic Account)
- Admissible inference rules of modal WCP-logics
- A note on admissible rules and the disjunction property in intermediate logics
- 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
This page was built for publication: ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4166741)