Admissible rules in the implication-negation fragment of intuitionistic logic
From MaRDI portal
Publication:638480
DOI10.1016/j.apal.2010.09.001zbMath1225.03011OpenAlexW2069051622MaRDI QIDQ638480
Publication date: 12 September 2011
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.2010.09.001
Abstract deductive systems (03B22) Subsystems of classical logic (including intuitionistic logic) (03B20) Intermediate logics (03B55)
Related Items (24)
On rules ⋮ Admissible bases via stable canonical rules ⋮ A syntactic approach to unification in transitive reflexive modal logics ⋮ Structural completeness in relevance logics ⋮ UNIFICATION IN INTERMEDIATE LOGICS ⋮ Tutorial on Admissible Rules in Gudauri ⋮ A Note on Extensions: Admissible Rules via Semantics ⋮ Proof complexity of intuitionistic implicational formulas ⋮ Admissibility in De Morgan algebras ⋮ On unification and admissible rules in Gabbay-de Jongh logics ⋮ KD is nullary ⋮ Admissibility in positive logics ⋮ Algebraic semantics for the ‐fragment of and its properties ⋮ Constructive methods for intuitionistic fuzzy implication operators ⋮ HEREDITARILY STRUCTURALLY COMPLETE POSITIVE LOGICS ⋮ Singly generated quasivarieties and residuated structures ⋮ Checking Admissibility Using Natural Dualities ⋮ Admissibility and refutation: some characterisations of intermediate logics ⋮ PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS ⋮ The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\) ⋮ Sugihara algebras: admissibility algebras via the test spaces method ⋮ Structural completeness in many-valued logics with rational constants ⋮ Algebraic semantics for the (↔, ¬¬)-fragment of IPC ⋮ Admissibility via natural dualities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intermediate logics and Visser's rules
- Complexity of admissible rules
- Proof theory for admissible rules
- Structural completeness in fuzzy logics
- Intuitionistic propositional logic is polynomial-space complete
- Admissibility of logical inference rules
- Best solving modal equations
- Weakly implicative (fuzzy) logics. I: Basic properties
- On the structural completeness of some pure implicational propositional calculi
- On the admissible rules of intuitionistic propositional logic
- Bases of Admissible Rules of Lukasiewicz Logic
- Structural Completeness in Substructural Logics
- Admissible Rules of Lukasiewicz Logic
- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
- One hundred and two problems in mathematical logic
- Unification in intuitionistic logic
- The decidability of certain intermediate propositional logics
- Admissible Rules of Modal Logics
This page was built for publication: Admissible rules in the implication-negation fragment of intuitionistic logic