The complexity of Gentzen systems for propositional logic
type: Item
instance of: scholarly article
title: The complexity of Gentzen systems for propositional logic
zbMATH Open document ID: 0688.03039
DOI: 10.1016/0304-3975(89)90147-3
author: Alasdair Urquhart
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 03F05
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B35
zbMATH DE Number: 4127200
zbMATH Keywords: complexity of Gentzen-style systems for propositional logic
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90147-3
OpenAlex ID: W2009733922
cites work: A simplified proof that regular resolution is exponential
cites work: Q4133141
cites work: The relative efficiency of propositional proof systems
cites work: Q4065548
cites work: On the complexity of regular resolution and the Davis-Putnam procedure
cites work: Q4302462
cites work: Q5516473
cites work: Q4043971
cites work: A note on regular resolution
cites work: Q5559220
cites work: Q4152212
cites work: Q3682462
cites work: Bounds for proof-search and speed-up in the predicate calculus
cites work: Q5685059
Recommended article: Q4729773
Recommended article: Q4934563
Recommended article: Complexity of deductions in a system of classical propositional calculus
Recommended article: Gentzen-like systems for partial propositional calculi. I. II
Recommended article: A note on the complexity of propositional Hoare logic
Recommended article: The Complexity of Propositional Proofs
Recommended article: Q4390867
Recommended article: Q4790400
description: scientific article; zbMATH DE number 4127200