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 April 2009, Xi'an, China. Lecture Notes in Computer Science, 4978 (Lectur). Springer Verlag , Germany , 318 - 329 . ISBN 978-3-540-79227-7Full text available as:
Available under licence : See the attached licence file.
In this paper we define and investigate basic logical closure properties of propositional proof systems such as closure of arbitrary proof systems under modus ponens or substitutions. As our main result we obtain a purely logical characterization of the degrees of schematic extensions of EF in terms of a simple combination of these properties. This result underlines the empirical evidence that EF and its extensions admit a robust definition which rests on only a few central concepts from propositional logic.
|Item Type:||Proceedings Paper|
|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|
|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|
|Depositing User:||Symplectic Publications|
|Date Deposited:||10 Dec 2012 11:28|
|Last Modified:||08 Jun 2014 21:11|
Actions (login required)