Sufficient conditions for cut elimination with complexity analysis
type: Item
instance of: scholarly article
title: Sufficient conditions for cut elimination with complexity analysis
zbMATH Open document ID: 1145.03033
published in: Annals of Pure and Applied Logic
publication date: 2007-11-27T00:00:00Z
Mathematics Subject Classification ID: 03F05
zbMATH DE Number: 5214662
zbMATH Keywords: complexity of cut elimination
zbMATH Keywords: sequent calculus
author: João Rasga
describes a project that uses: Pesca
MaRDI profile type: Publication
full work available at URL: j.apal.2007.08.001
OpenAlex ID: W2087025946
cites work: Q4539639
cites work: Non-deterministic Multiple-valued Structures
cites work: Cut normal forms and proof complexity
cites work: Cut-elimination and redundancy-elimination by resolution
cites work: Q4436026
cites work: Display logic
cites work: Q4215630
cites work: Duplication of directed graphs and exponential blow up of proofs
cites work: Towards a semantic characterization of cut-elimination
cites work: The relative efficiency of propositional proof systems
cites work: Contraction-free sequent calculi for intuitionistic logic
cites work: The role of quantifier alternations in cut elimination
cites work: Linear logic
cites work: Q4783301
cites work: Bounds for cut elimination in intuitionistic propositional logic
cites work: The Mathematics of Sentence Structure
cites work: Modal Sequent Calculi Labelled with Truth Values: Cut Elimination
cites work: Q4412848
cites work: Indexed systems of sequents and cut-elimination
cites work: Structural proof theory. With an appendix by Aarne Ranta
cites work: Q3866101
cites work: Q4805593
cites work: Q3285631
cites work: Intuitionistic propositional logic is polynomial-space complete
cites work: Q5605873
cites work: Which structural rules admit cut elimination? An algebraic criterion
cites work: Q4499084
cites work: The unprovability of small inconsistency. A study of local and global interpretability
cites work: Cut elimination and automatic proof procedures
cites work: Depth of proofs, depth of cut-formulas and complexity of cut formulas
DOI: 10.1016/J.APAL.2007.08.001
Recommended article: Computer Science Logic
Recommended article: Towards an algorithmic construction of cut-elimination procedures
Recommended article: Q4436026
Recommended article: On the computational complexity of cut-reduction
Recommended article: Structure of proofs and the complexity of cut elimination
Recommended article: Sharpened lower bounds for cut elimination
Recommended article: Cut Elimination in ε‐Calculi
Recommended article: Q3086775
Recommended article: Theoretical Computer Science
Recommended article: Q2778826
description: scientific article