Cut elimination inside a deep inference system for classical predicate logic

DOI10.1007/s11225-006-6605-4zbMath1097.03047OpenAlexW2008876986MaRDI QIDQ817702

Kai Brünnler

Publication date: 17 March 2006

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

Full work available at URL: https://boris.unibe.ch/19297/1/11225_2006_Article_6605.pdf

zbMATH Keywords

cut eliminationfirst-order predicate logicdeep inference

Mathematics Subject Classification ID

Classical first-order logic (03B10) Cut-elimination and normal-form theorems (03F05)

Related Items

A Subatomic Proof System for Decision Trees, On the Power of Substitution in the Calculus of Structures, Intermutation, A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains

Cites Work

• Display logic
• On the limit products of a family of matrices
• A system of interaction and structure
• Computer Science Logic
• Computer Science Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item