Modular Cut-Elimination: Finding Proofs or Counterexamples

DOI10.1007/11916277_10MaRDI QIDQ5387889zbMATH OpenOpenAlexFDO

Authors Agata Ciabattoni, Kazushige Terui

Publication date 27 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11916277_10

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Generic modal cut elimination applied to conditional logics
• Generic Modal Cut Elimination Applied to Conditional Logics
• Typed Lambda Calculi and Applications
• Cut Elimination in Deduction Modulo by Abstract Completion
• Proof normalization modulo

Cited in

(7)

• About folding-unfolding cuts and cuts modulo
• scientific article; zbMATH DE number 4212036 (Why is no real title available?)
• Unwinding a Non-effective Cut Elimination Proof
• On Constructive Cut Admissibility in Deduction Modulo
• Proof normalization modulo
• Generic modal cut elimination applied to conditional logics
• Invertibility in Sequent Calculi

This page was built for publication: Modular Cut-Elimination: Finding Proofs or Counterexamples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387889)