Abstract
We now study a language, known as (Boolean, or classical) propositional logic. While it is more extended than the language of clauses considered so far, as we will see, it is not more expressive. For this language it is still possible to define precisely the concepts of satisfiability, logical equivalence and logical consequence.
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
Notes
- 1.
In mathematical texts, for typographical reasons, trees grow downwards.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Italia
About this chapter
Cite this chapter
Mundici, D. (2012). Propositional Logic: Syntax. In: Logic: A Brief Course. UNITEXT(). Springer, Milano. https://doi.org/10.1007/978-88-470-2361-1_7
Download citation
DOI: https://doi.org/10.1007/978-88-470-2361-1_7
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-2360-4
Online ISBN: 978-88-470-2361-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)