Abstract
The Hilbert proof systems are systems based on a language with implication and contain a Modus Ponens rule as a rule of inference. They are usually called Hilbert style formalizations. We will call them here Hilbert style proof systems, or Hilbert systems, for short.
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
5.1 Electronic Supplementary Material
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Wasilewska, A. (2018). Hilbert Proof Systems Completeness of Classical Propositional Logic. In: Logics for Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-92591-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-92591-2_5
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)