Abstract
Hilbert style systems are easy to define and admit different proofs of the Completeness Theorem but they are difficult to use. By humans, not mentioning computers. Their emphasis is on logical axioms, keeping the rules of inference, with obligatory Modus Ponens, at a minimum.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Change history
09 May 2019
All the chapters of this book were inadvertently published without including the extra supplementary materials. The same has been included now.
Author information
Authors and Affiliations
6.1 Electronic Supplementary Material
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Wasilewska, A. (2018). Automated Proof Systems Completeness of Classical Propositional Logic. In: Logics for Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-92591-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-92591-2_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92590-5
Online ISBN: 978-3-319-92591-2
eBook Packages: Computer ScienceComputer Science (R0)