Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
From MaRDI portal
Publication:3605532
DOI10.1007/978-3-540-92687-0_16zbMath1211.03037OpenAlexW1591857789MaRDI QIDQ3605532
George Metcalfe, Rosalie Iemhoff
Publication date: 24 February 2009
Published in: Logical Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/33718
Related Items (8)
On rules ⋮ A syntactic approach to unification in transitive reflexive modal logics ⋮ Tutorial on Admissible Rules in Gudauri ⋮ A Note on Extensions: Admissible Rules via Semantics ⋮ Admissible rules in the implication-negation fragment of intuitionistic logic ⋮ A meta-logic of inference rules: Syntax ⋮ Hypersequent and display calculi -- a unified perspective ⋮ Proof theory for admissible rules
Cites Work
- Unnamed Item
- Intermediate logics and Visser's rules
- Proof theory for admissible rules
- Admissibility of logical inference rules
- Best solving modal equations
- Proof theory for fuzzy logics
- Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
- On the admissible rules of intuitionistic propositional logic
- A constructive analysis of RM
- Unification in intuitionistic logic
- Filtering unification and most general unifiers in modal logic
- Admissible Rules of Modal Logics
This page was built for publication: Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics