Category:Propositional Logic
Definition
Propositional logic is a sub-branch of symbolic logic in which the truth values of statement forms is investigated and analysed.
Definitions specific to this category can be found in Definitions/Propositional Logic.
The atoms of propositional logic are simple statements.
As propositional logic is such a mouthful and takes so long to write, some authors succumb to the temptation to abbreviate it by referring to it more-or-less consistently as PropLog.
It is also referred to as zeroth order logic (where first order logic is predicate logic).
There are various systems of propositional logic for determining the truth value of statement forms.
- Natural deduction is a technique for deducing valid sequents from other valid sequents by applying precisely defined proof rules, each of which themselves are either "self-evident" axioms or themselves derived from other valid sequents.
Also see
Sources
- M. Ben-Ari: Mathematical Logic for Computer Science (1993): $\S 1.2$
- H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability (1996): $\S 1$
Subcategories
This category has only the following subcategory.
P
Pages in category "Propositional Logic"
The following 77 pages are in this category, out of 77 total.
