No Cover Image

Journal article 1706 views

On the computational complexity of cut-reduction

Klaus Aehlig, Arnold Beckmann Orcid Logo

Annals of Pure and Applied Logic, Volume: 161, Issue: 6, Pages: 711 - 736

Swansea University Author: Arnold Beckmann Orcid Logo

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1016/j.apal.2009.06.004

Abstract

Using 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 theo...

Full description

Published in: Annals of Pure and Applied Logic
ISSN: 0168-0072
Published: Elsevier 2009
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa161
first_indexed 2013-07-23T11:47:52Z
last_indexed 2018-02-09T04:27:01Z
id cronfa161
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2015-06-30T20:37:23.7112985</datestamp><bib-version>v2</bib-version><id>161</id><entry>2012-02-23</entry><title>On the computational complexity of cut-reduction</title><swanseaauthors><author><sid>1439ebd690110a50a797b7ec78cca600</sid><ORCID>0000-0001-7958-5790</ORCID><firstname>Arnold</firstname><surname>Beckmann</surname><name>Arnold Beckmann</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2012-02-23</date><deptcode>MACS</deptcode><abstract>Using 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.</abstract><type>Journal Article</type><journal>Annals of Pure and Applied Logic</journal><volume>161</volume><journalNumber>6</journalNumber><paginationStart>711</paginationStart><paginationEnd>736</paginationEnd><publisher>Elsevier</publisher><issnPrint>0168-0072</issnPrint><issnElectronic/><keywords/><publishedDay>14</publishedDay><publishedMonth>7</publishedMonth><publishedYear>2009</publishedYear><publishedDate>2009-07-14</publishedDate><doi>10.1016/j.apal.2009.06.004</doi><url/><notes/><college>COLLEGE NANME</college><department>Mathematics and Computer Science School</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MACS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2015-06-30T20:37:23.7112985</lastEdited><Created>2012-02-23T17:02:00.0000000</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Klaus</firstname><surname>Aehlig</surname><order>1</order></author><author><firstname>Arnold</firstname><surname>Beckmann</surname><orcid>0000-0001-7958-5790</orcid><order>2</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2015-06-30T20:37:23.7112985 v2 161 2012-02-23 On the computational complexity of cut-reduction 1439ebd690110a50a797b7ec78cca600 0000-0001-7958-5790 Arnold Beckmann Arnold Beckmann true false 2012-02-23 MACS Using 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. Journal Article Annals of Pure and Applied Logic 161 6 711 736 Elsevier 0168-0072 14 7 2009 2009-07-14 10.1016/j.apal.2009.06.004 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University 2015-06-30T20:37:23.7112985 2012-02-23T17:02:00.0000000 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Klaus Aehlig 1 Arnold Beckmann 0000-0001-7958-5790 2
title On the computational complexity of cut-reduction
spellingShingle On the computational complexity of cut-reduction
Arnold Beckmann
title_short On the computational complexity of cut-reduction
title_full On the computational complexity of cut-reduction
title_fullStr On the computational complexity of cut-reduction
title_full_unstemmed On the computational complexity of cut-reduction
title_sort On the computational complexity of cut-reduction
author_id_str_mv 1439ebd690110a50a797b7ec78cca600
author_id_fullname_str_mv 1439ebd690110a50a797b7ec78cca600_***_Arnold Beckmann
author Arnold Beckmann
author2 Klaus Aehlig
Arnold Beckmann
format Journal article
container_title Annals of Pure and Applied Logic
container_volume 161
container_issue 6
container_start_page 711
publishDate 2009
institution Swansea University
issn 0168-0072
doi_str_mv 10.1016/j.apal.2009.06.004
publisher Elsevier
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
description Using 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.
published_date 2009-07-14T03:03:53Z
_version_ 1851088787173539840
score 11.089407

Similar Items