Abstract
The concept of deducing theorems from a set of axioms and rules of inference is very old and is familiar to every high-school student who has studied Euclidean geometry. Modern mathematics is expressed in a style of reasoning that is not far removed from the reasoning used by Greek mathematicians. This style can be characterized as ‘formalized informal reasoning’, meaning that while the proofs are expressed in natural language rather than in a formal system, there are conventions among mathematicians as to the forms of reasoning that are allowed. The deductive systems studied in this chapter were developed in an attempt to formalize mathematical reasoning.
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
References
M. Huth and M.D. Ryan. Logic in Computer Science: Modelling and Reasoning about Systems (Second Edition). Cambridge University Press, 2004.
E. Mendelson. Introduction to Mathematical Logic (Fifth Edition). Chapman & Hall/CRC, 2009.
J.D. Monk. Mathematical Logic. Springer, 1976.
R.M. Smullyan. First-Order Logic. Springer-Verlag, 1968. Reprinted by Dover, 1995.
D.J. Velleman. How to Prove It: A Structured Approach (Second Edition). Cambridge University Press, 2006.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London
About this chapter
Cite this chapter
Ben-Ari, M. (2012). Propositional Logic: Deductive Systems. In: Mathematical Logic for Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4129-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4129-7_3
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4128-0
Online ISBN: 978-1-4471-4129-7
eBook Packages: Computer ScienceComputer Science (R0)