Computer Science Logic

DOI10.1007/b13224zbMath1116.03304OpenAlexW2623947920MaRDI QIDQ5292641

Rosalie Iemhoff

Publication date: 21 June 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13224

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (8)

Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) ⋮ On unification and admissible rules in Gabbay-de Jongh logics ⋮ Best unifiers in transitive modal logics ⋮ Intermediate logics and Visser's rules ⋮ Unification in linear temporal logic LTL ⋮ On the rules of intermediate logics ⋮ Proof theory for admissible rules ⋮ Inference rules in Nelson's logics, admissibility and weak admissibility

This page was built for publication: Computer Science Logic