A Short and Readable Proof of Cut Elimination for Two First-Order Modal Logics

DOI10.18778/0138-0680.44.3.4.03zbMATH Open1357.03086OpenAlexW2345246322MaRDI QIDQ2810127

No author found.

Publication date: 31 May 2016

Published in: Bulletin of the Section of Logic (Search for Journal in Brave)

Full work available at URL: http://www.filozof.uni.lodz.pl/bulletin/pdf/44_34_3.pdf

zbMATH Keywords

cut eliminationGentzenisationHilbert-style modal logic

Mathematics Subject Classification ID

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

Related Items (4)

Tautology Elimination, Cut Elimination, and S5 ⋮ An Arithmetically Complete Predicate Modal Logic ⋮ Unnamed Item ⋮ Generic Modal Cut Elimination Applied to Conditional Logics

This page was built for publication: A Short and Readable Proof of Cut Elimination for Two First-Order Modal Logics