Structural cut elimination. I: Intuitionistic and classical logic
type: Item
instance of: scholarly article
title: Structural cut elimination. I: Intuitionistic and classical logic
zbMATH Open document ID: 1005.03049
author: Frank Pfenning
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 03F05
zbMATH DE Number: 1853094
zbMATH Keywords: cut elimination
describes a project that uses: Coq
describes a project that uses: Elf
MaRDI profile type: Publication
full work available at URL: inco.1999.2832
OpenAlex ID: W1546574044
cites work: Computational interpretations of linear logic
cites work: Q3024831
cites work: Q4039813
cites work: Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi
cites work: Untersuchungen über das logische Schliessen. I
cites work: Linear logic
cites work: On the unity of logic
cites work: A framework for defining logics
cites work: Q5812175
cites work: Q4698613
cites work: Q5181669
cites work: Uniform proofs as a foundation for logic programming
cites work: Q4255509
cites work: Q4012879
cites work: Q3999539
cites work: The correspondence between cut-elimination and normalization
DOI: 10.1006/INCO.1999.2832
Recommended article: Q3475264
Recommended article: A cut-elimination proof in intuitionistic predicate logic
Recommended article: Cut Elimination and Decidability for Classical Lambek Logic
Recommended article: A note on cut-elimination for classical propositional logic
Recommended article: Typed Lambda Calculi and Applications
Recommended article: Bounds for cut elimination in intuitionistic propositional logic
Recommended article: Q3997528
Recommended article: Cut Elimination in Nested Sequents for Intuitionistic Modal Logics
Recommended article: Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
Recommended article: Q5351952
description: scientific article; zbMATH DE number 1853094