On the computational complexity of cut-reduction

Simple item page
dc.creatorAehlig, Klaus
dc.creatorBeckmann, Arnold
dc.date2007-12-10
dc.date.accessioned2026-07-07T08:48:18Z
dc.date.available2026-07-07T08:48:18Z
dc.descriptionUsing appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all the known results on definable functions of certain such theories can be reobtained in a uniform way.
dc.description41 pages, technical report (CS, Swansea University)
dc.identifierhttps://arxiv.org/abs/0712.1499
dc.identifierhttp://arxiv.org/abs/0712.1499
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143898
dc.subjectLogic in Computer Science
dc.subjectComputational Complexity
dc.subjectF.4.1
dc.titleOn the computational complexity of cut-reduction
dc.typetext

Files

Collections

arXiv