Logical closure properties of propositional proof systems - (Extended abstract)

Beyersdorff, O (2008) Logical closure properties of propositional proof systems - (Extended abstract). In: Agrawal, M, Du, D, Duan, Z and Li, A, (eds.) Theory and Applications of Models of Computation. 5th International Conference on Theory and Applications of Models of Computation, 25-28 Apr 2009, Xi'an, China. Lecture Notes in Computer Science, 4978 (Lectur). Springer Verlag , Germany , 318 - 329 . ISBN 978-3-540-79227-7

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
Copyright, Publisher and Additional Information: © 2008, Springer Verlag. This is an author produced version of a paper published in Theory and Applications of Models of Computation. Uploaded in accordance with the publisher's self-archiving policy. The original publication is available at www.springerlink.com
Dates:
  • Published: 2008
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: 10 Dec 2012 11:28
Last Modified: 19 Dec 2022 13:24
Published Version: http://dx.doi.org/10.1007/978-3-540-79228-4_28
Status: Published
Publisher: Springer Verlag
Series Name: Lecture Notes in Computer Science
Identification Number: https://doi.org/10.1007/978-3-540-79228-4_28

Export

Statistics


CORE (COnnecting REpositories)