No Cover Image

Book 657 views

Bounded Arithmetic and Resolution-Based Proof Systems / Arnold Beckmann

Collegium Logicum, Volume: 7

Swansea University Author: Arnold Beckmann

Abstract

This book is about two topics on the borderline between logic and complexity theory, and in particular about the connections between these. The first topic is Bounded Arithmetic, and the other is the complexity of propositional proof systems.

Published in: Collegium Logicum
ISBN: 3-901546-02-2
Published: Vienna Kurt Gödel Society 2004
Online Access: http://kgs.logic.at/index.php?id=9
URI: https://cronfa.swan.ac.uk/Record/cronfa14893
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T12:13:05Z
last_indexed 2018-02-09T04:46:33Z
id cronfa14893
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2018-02-06T16:39:24.2214336</datestamp><bib-version>v2</bib-version><id>14893</id><entry>2013-05-24</entry><title>Bounded Arithmetic and Resolution-Based Proof Systems</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>2013-05-24</date><deptcode>SCS</deptcode><abstract>This book is about two topics on the borderline between logic and complexity theory, and in particular about the connections between these. The first topic is Bounded Arithmetic, and the other is the complexity of propositional proof systems.</abstract><type>Book</type><journal>Collegium Logicum</journal><volume>7</volume><publisher>Kurt G&#xF6;del Society</publisher><placeOfPublication>Vienna</placeOfPublication><isbnPrint>3-901546-02-2</isbnPrint><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2004</publishedYear><publishedDate>2004-12-31</publishedDate><doi/><url>http://kgs.logic.at/index.php?id=9</url><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2018-02-06T16:39:24.2214336</lastEdited><Created>2013-05-24T21:00:17.5428458</Created><path><level id="1">College of Science</level><level id="2">Computer Science</level></path><authors><author><firstname>Arnold</firstname><surname>Beckmann</surname><orcid>0000-0001-7958-5790</orcid><order>1</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2018-02-06T16:39:24.2214336 v2 14893 2013-05-24 Bounded Arithmetic and Resolution-Based Proof Systems 1439ebd690110a50a797b7ec78cca600 0000-0001-7958-5790 Arnold Beckmann Arnold Beckmann true false 2013-05-24 SCS This book is about two topics on the borderline between logic and complexity theory, and in particular about the connections between these. The first topic is Bounded Arithmetic, and the other is the complexity of propositional proof systems. Book Collegium Logicum 7 Kurt Gödel Society Vienna 3-901546-02-2 31 12 2004 2004-12-31 http://kgs.logic.at/index.php?id=9 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2018-02-06T16:39:24.2214336 2013-05-24T21:00:17.5428458 College of Science Computer Science Arnold Beckmann 0000-0001-7958-5790 1
title Bounded Arithmetic and Resolution-Based Proof Systems
spellingShingle Bounded Arithmetic and Resolution-Based Proof Systems
Arnold, Beckmann
title_short Bounded Arithmetic and Resolution-Based Proof Systems
title_full Bounded Arithmetic and Resolution-Based Proof Systems
title_fullStr Bounded Arithmetic and Resolution-Based Proof Systems
title_full_unstemmed Bounded Arithmetic and Resolution-Based Proof Systems
title_sort Bounded Arithmetic and Resolution-Based Proof Systems
author_id_str_mv 1439ebd690110a50a797b7ec78cca600
author_id_fullname_str_mv 1439ebd690110a50a797b7ec78cca600_***_Arnold, Beckmann
author Arnold, Beckmann
author2 Arnold Beckmann
format Book
container_title Collegium Logicum
container_volume 7
publishDate 2004
institution Swansea University
isbn 3-901546-02-2
publisher Kurt Gödel Society
college_str College of Science
hierarchytype
hierarchy_top_id collegeofscience
hierarchy_top_title College of Science
hierarchy_parent_id collegeofscience
hierarchy_parent_title College of Science
department_str Computer Science{{{_:::_}}}College of Science{{{_:::_}}}Computer Science
url http://kgs.logic.at/index.php?id=9
document_store_str 0
active_str 0
description This book is about two topics on the borderline between logic and complexity theory, and in particular about the connections between these. The first topic is Bounded Arithmetic, and the other is the complexity of propositional proof systems.
published_date 2004-12-31T03:26:52Z
_version_ 1714738024154136576
score 10.830325