On permuting cut with contraction

DOI10.1017/S0960129599003011zbMath0949.03054arXivmath/9911065MaRDI QIDQ4487267

Mirjana Borisavljević, Kosta Došen, Zoran Petrić

Publication date: 24 July 2000

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9911065

zbMATH Keywords

cut eliminationpropositional intuitionistic logicsequential formalizationstructural rule of contraction

Mathematics Subject Classification ID

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

Related Items (4)

A connection between cut elimination and normalization ⋮ VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED ⋮ Gentzen's consistency proof without heightlines ⋮ The elimination of maximum cuts in linear logic and BCK logic

This page was built for publication: On permuting cut with contraction