An explicit basis for \textit{WCP}-globally admissible inference rules
From MaRDI portal
Publication:6199357
DOI10.1007/s10469-024-09733-6OpenAlexW4391845912MaRDI QIDQ6199357
No author found.
Publication date: 23 February 2024
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-024-09733-6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bases of admissible rules for \(K\)-saturated logics
- Independent bases for admissible rules of pretabular modal logic and its extensions
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Bases of admissible rules of the logics S4 and Int
- The deducibilities of S5
- Derivability of admissible rules
- Admissibility of logical inference rules
- On the admissible rules of intuitionistic propositional logic
- Construction of an Explicit Basis for Rules Admissible in Modal System S4
- Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
- Independent Bases of Admissible Rules
- One hundred and two problems in mathematical logic
- Admissible Rules of Modal Logics
- A(nother) characterization of intuitionistic propositional logic
This page was built for publication: An explicit basis for \textit{WCP}-globally admissible inference rules