Tree-Sequent Methods for Subintuitionistic Predicate Logics

DOI10.1007/978-3-540-73099-6_13zbMath1132.03312OpenAlexW1526548725MaRDI QIDQ5434487

Ryo Ishigaki, Kentaro Kikuchi

Publication date: 4 January 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73099-6_13

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (3)

Alternative Semantics for Visser’s Propositional Logics ⋮ Display calculi and other modal calculi: a comparison ⋮ A canonical model for constant domain basic first-order logic

This page was built for publication: Tree-Sequent Methods for Subintuitionistic Predicate Logics