Semantics 1 (Sailer): Week 5: Difference between revisions
Jump to navigation
Jump to search
(Created page with " == Formulae with more than one connective == The video shows how the truth value of a more complex formula can be computed. The example contains two connectives: '''kill(ma...") |
|||
Line 53: | Line 53: | ||
<hr /> | <hr /> | ||
Back to the [[Semantics 1 (Sailer) | Back to the [[Semantics 1, SoSe 2016 (Sailer)|course overview]]. |
Latest revision as of 09:00, 24 May 2016
Formulae with more than one connective
The video shows how the truth value of a more complex formula can be computed. The example contains two connectives:
kill(malcom,lady-macbeth) ∨ ¬thane(macbeth)
The video shows two different methods: top down and bottom up.
Truth tables
(The following exercises have been copied here from the page on exercises for truth tables.)
Truth tables for complex formulae
Truth tables are also useful to compute the truth value of complex formulae. This is shown in the following podcast, created by Lisa Günthner.
Preparation for week 5
- Read Levine et al (in prep.), Chapter 2, section 2.
- Using your model from last week,
- Give 1 formula with ⊃.
- Give 1 formule with 2 different connectives (both distinct from ⊃)
- Provide the step-by-step computation of the truth of your 2 formulae.
Back to the course overview.