No Cover Image

Conference Paper/Proceeding/Abstract 1722 views

On the Computational Complexity of Cut-Reduction

Klaus Aehlig, Arnold Beckmann Orcid Logo

Pages: 284 - 293

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.1109/LICS.2008.9

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

ISSN: 1043-6871
Published: IEEE 2008
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa57
first_indexed 2013-07-23T11:49:25Z
last_indexed 2018-02-09T04:27:23Z
id cronfa57
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2013-10-17T11:45:13.7115249</datestamp><bib-version>v2</bib-version><id>57</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>Conference Paper/Proceeding/Abstract</type><journal></journal><volume></volume><journalNumber></journalNumber><paginationStart>284</paginationStart><paginationEnd>293</paginationEnd><publisher>IEEE</publisher><placeOfPublication/><issnPrint>1043-6871</issnPrint><issnElectronic/><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2008</publishedYear><publishedDate>2008-12-31</publishedDate><doi>10.1109/LICS.2008.9</doi><url/><notes>In 23rd Annual IEEE Symposium on Logic in Computer Science, Proceedings, Pittsburgh, PA, USA</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>2013-10-17T11:45:13.7115249</lastEdited><Created>2012-02-23T17:02:01.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 2013-10-17T11:45:13.7115249 v2 57 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. Conference Paper/Proceeding/Abstract 284 293 IEEE 1043-6871 31 12 2008 2008-12-31 10.1109/LICS.2008.9 In 23rd Annual IEEE Symposium on Logic in Computer Science, Proceedings, Pittsburgh, PA, USA COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University 2013-10-17T11:45:13.7115249 2012-02-23T17:02:01.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 Conference Paper/Proceeding/Abstract
container_start_page 284
publishDate 2008
institution Swansea University
issn 1043-6871
doi_str_mv 10.1109/LICS.2008.9
publisher IEEE
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 2008-12-31T03:04:25Z
_version_ 1851088820363067392
score 11.089407

Similar Items