Proof complexity of non-classical logics

Beyersdorff, O and Kutz, O (2012) Proof complexity of non-classical logics. In: Bezhanishvili, N and Goranko, V, (eds.) Lectures on Logic and Computation ESSLLI 2010 Copenhagen, Denmark, August 2010, ESSLLI 2011, Ljubljana, Slovenia, August 2011, Selected Lecture Notes. Lecture Notes in Computer Science, 7388 . Springer Verlag , 1 - 54 . ISBN 978-3-642-31484-1

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Kutz, O
Copyright, Publisher and Additional Information: © 2012, Springer Verlag. This is an author produced version of a chapter published in Lectures on Logic and Computation. Uploaded in accordance with the publisher's self-archiving policy. The original publication is available at www.springerlink.com
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 03 Dec 2012 10:57
Last Modified: 29 Oct 2016 09:46
Published Version: http://dx.doi.org/10.1007/978-3-642-31485-8
Status: Published
Publisher: Springer Verlag
Identification Number: https://doi.org/10.1007/978-3-642-31485-8

Download

Filename: proofcomplexity.pdf

Share / Export

Statistics