A cut-free sequent system for the smallest interpretability logic

DOI10.1023/A:1015150314504zbMath0998.03046OpenAlexW1543339683MaRDI QIDQ1604800

Katsumi Sasaki

Publication date: 8 July 2002

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015150314504

zbMATH Keywords

interpretability logiccut-elimination theoremcut-free sequent system

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

This page was built for publication: A cut-free sequent system for the smallest interpretability logic