Upper bound on the lengthening of proofs by cut elimination
type: Item
instance of: scholarly article
title: Upper bound on the lengthening of proofs by cut elimination
zbMATH Open document ID: 0595.03050
DOI: 10.1007/BF01095640
author: V. P. Orevkov
published in: Journal of Soviet Mathematics
publication date: 1986-01-01T00:00:00Z
review text: Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 137, 87-98 (Russian) (1984; Zbl 0562.03027).
Mathematics Subject Classification ID: 03F05
Mathematics Subject Classification ID: 03F20
zbMATH DE Number: 3957094
zbMATH Keywords: intuitionistic predicate calculus
zbMATH Keywords: classical sequential calculus of
zbMATH Keywords: predicates
zbMATH Keywords: derivation-tree of a sequent
zbMATH Keywords: cut-free proof
MaRDI profile type: Publication
cites work: Bounds for proof-search and speed-up in the predicate calculus
description: scientific article; zbMATH DE number 3957094