A Syntactic Proof of Cut‐Elimination For GLlin

DOI10.1002/malq.19860320707zbMath0624.03041OpenAlexW2075208653MaRDI QIDQ3762309

Silvio Valentini

Publication date: 1986

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19860320707

zbMATH Keywords

modal logicnecessitationmodus ponensmodal logic of provabilitysyntactic proof of cut- elimination

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05)

Related Items (2)

VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED ⋮ Cut-free sequent and tableau systems for propositional Diodorean modal logics

This page was built for publication: A Syntactic Proof of Cut‐Elimination For GL_lin