Proof Complexity of Non-classical Logics.

Beyersdorff, O (2010) Proof Complexity of Non-classical Logics. In: Kratochvíl, J, Li, A, Fiala, J and Kolman, P, (eds.) Theory and Applications of Models of Computation7th Annual Conference, TAMC 2010, Proceedings. Theory and Applications of Models of Computation, 7th Conference, 07-11 Jun 2010, Prague, Czech Republic. Lecture Notes in Computer Science, 108 (6). Springer , 15 - 27 . ISBN 978-3-642-13561-3

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
  • Beyersdorff, O
Editors:
  • Kratochvíl, J
  • Li, A
  • Fiala, J
  • Kolman, P
Copyright, Publisher and Additional Information:

© 2010, Springer. This is an author produced version of a paper published in Lecture Notes in Computer Science. Uploaded in accordance with the publisher's self-archiving policy. The original publication is available at www.springerlink.com

Dates:
  • Published: 2010
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 12 Apr 2013 10:08
Last Modified: 19 Dec 2022 13:24
Published Version: http://dx.doi.org/10.1007/978-3-642-13562-0
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Identification Number: 10.1007/978-3-642-13562-0_3
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)