Lower bounds for increasing complexity of derivations after cut elimination
type: Item
instance of: scholarly article
title: Lower bounds for increasing complexity of derivations after cut elimination
zbMATH Open document ID: 0492.03023
DOI: 10.1007/BF01629444
author: V. P. Orevkov
published in: Journal of Soviet Mathematics
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 03F05
zbMATH DE Number: 3773586
zbMATH Keywords: lower bounds for proof length
MaRDI profile type: Publication
cites work: Untersuchungen über das logische Schliessen. I
cites work: Q5812175
cites work: Q5547552
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Q5541351
full work available at URL: https://doi.org/10.1007/bf01629444
OpenAlex ID: W1990529320
description: scientific article; zbMATH DE number 3773586