Some remarks on lengths of propositional proofs
type: Item
instance of: scholarly article
title: Some remarks on lengths of propositional proofs
zbMATH Open document ID: 0841.03030
DOI: 10.1007/BF02391554
author: Samuel R. Buss
published in: Archive for Mathematical Logic
publication date: 1996-07-16T00:00:00Z
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 03B05
zbMATH DE Number: 851906
zbMATH Keywords: survey
zbMATH Keywords: lower bounds
zbMATH Keywords: Frege proofs
zbMATH Keywords: sequent calculus proofs
zbMATH Keywords: number of distinct subformulas
zbMATH Keywords: propositional proof length
zbMATH Keywords: logical flow graphs
MaRDI profile type: Publication
cites work: Q3140632
cites work: The deduction rule and linear and near-linear proof simulations
cites work: Polynomial size proofs of the propositional pigeonhole principle
cites work: The undecidability of \(k\)-provability
cites work: Q4850546
cites work: The relative efficiency of propositional proof systems
cites work: On the number of steps in proofs
cites work: Q3829548
cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations
cites work: An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
cites work: Exponential lower bounds for the pigeonhole principle
cites work: Q4152212
cites work: Q3882451
cites work: Proof theory. 2nd ed
description: scientific article; zbMATH DE number 851906