The relative complexity of resolution and cut-free Gentzen systems
type: Item
instance of: scholarly article
title: The relative complexity of resolution and cut-free Gentzen systems
zbMATH Open document ID: 0865.03011
DOI: 10.1007/BF01531026
author: Alasdair Urquhart
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-05-13T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03F03
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 03B05
zbMATH DE Number: 1005824
zbMATH Keywords: resolution
zbMATH Keywords: cut-free Gentzen system
zbMATH Keywords: proof systems for biconditionals
zbMATH Keywords: classical propositional calculus
zbMATH Keywords: relative efficiency
zbMATH Keywords: simulation
MaRDI profile type: Publication
cites work: The relative efficiency of propositional proof systems
cites work: On the complexity of regular resolution and the Davis-Putnam procedure
cites work: Seventy-five problems for testing automatic theorem provers
cites work: Q5560258
cites work: Hard examples for resolution
cites work: The complexity of Gentzen systems for propositional logic
cites work: Toward Mechanical Mathematics
full work available at URL: https://doi.org/10.1007/bf01531026
OpenAlex ID: W2013167486
description: scientific article; zbMATH DE number 1005824