Jump to navigation Jump to search
- 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.
This category has the following 27 subcategories, out of 27 total.
- ► Disjunction (28 C, 57 P)
- ► Exclusive Or (6 C, 13 P)
- ► Functional Completeness (15 P)
- ► Implication (45 C, 59 P)
Pages in category "Propositional Logic"
The following 38 pages are in this category, out of 38 total.
- Equivalence of Definitions of Consistent Proof System
- Equivalence of Definitions of Consistent Set of Formulas
- Equivalence of Logical Implication and Conditional
- Equivalence of Semantic Consequence and Logical Implication
- Existence of Conjunctive Normal Form of Statement
- Existence of Disjunctive Normal Form of Statement
- Existence of Negation Normal Form of Statement
- Semantic Tableau Algorithm
- Semantic Tableau Algorithm is Decision Procedure for Tautologies
- Semantic Tableau Algorithm Terminates
- Semantic Tableau Algorithm/Heuristics
- Set of Literals Satisfiable iff No Complementary Pairs
- Socrates is Mortal/Variant
- Soundness and Completeness of Gentzen Proof System
- Soundness and Completeness of Semantic Tableaus
- Soundness and Completeness of Semantic Tableaus/Corollary 1
- Soundness and Completeness of Semantic Tableaus/Corollary 2
- Soundness Theorem for Semantic Tableaus
- Substitution for Equivalent Subformula is Equivalent