Semantics 1, SoSe 2016 (Sailer): Difference between revisions

From Lexical Resource Semantics
Jump to navigation Jump to search
Line 10: Line 10:


<embedvideo service="youtube" dimensions="400">http://youtu.be/C1rjU104R54</embedvideo>
<embedvideo service="youtube" dimensions="400">http://youtu.be/C1rjU104R54</embedvideo>
== Truth tables ==
<quiz display="simple">
{Click on the boxes for which the truth value would be ''true''.
|type="[]"}
| '''p''' | '''q''' | <span style="color:white">zwisch</span>('''p ''' &and; '''q''')<span style="color:white">zwisch</span> | <span style="color:white">zwisch</span> &not;('''p ''' &and; '''q''')<span style="color:white">zwisch</span>|<span style="color:white">zwisch</span>('''q''' &sup; &not; ('''p &and; q'''))<span style="color:white">zwisch</span>
+++-- (both '''p''' and '''q''' are true)
+--++ ('''p''' is true, but not '''q''')
-+-++ ('''p''' is false, but '''q''' is true)
---++ (both '''p''' and '''q''' are false)
</quiz>
<quiz display="simple">
{Click on the boxes for which the truth value would be ''true''.
|type="[]"}
| '''p''' | '''q''' | '''r''' |<span style="color:white">zwisch</span>&not; r<span style="color:white">zwisch</span> | <span style="color:white">zwisch</span> ('''p ''' &or; '''q''')<span style="color:white">zwisch</span>|<span style="color:white">zwisch</span>(('''p &or; q''') &sup; &not;r)<span style="color:white">zwisch</span>
+++-+- ('''p''', '''q''', and '''r''' are true)
++-+++ ('''p''' and '''q''' are true, '''r''' is false)
+-+-+- ('''p''' and '''r''' are true, '''q''' is false)
+--+++ ('''p''' is true, '''q''' and '''r''' are false)
-++-+- ('''p''' is false, '''q''' and '''r''' are true)
-+-+-+ ('''p''' and '''r''' are false, '''q''' is true)
--+--+ ('''p''' and '''q''' are false, '''r''' is true)
---+-+ ('''p''', '''q''', and '''r''' are false)
</quiz>


== Preparation for week 5 ==
== Preparation for week 5 ==

Revision as of 20:10, 3 May 2016

Additional material for week 5

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

Click on the boxes for which the truth value would be true.

p q zwisch(p ∧ q)zwisch zwisch ¬(p ∧ q)zwischzwisch(q ⊃ ¬ (p ∧ q))zwisch
(both p and q are true)
(p is true, but not q)
(p is false, but q is true)
(both p and q are false)



Click on the boxes for which the truth value would be true.

p q r zwisch¬ rzwisch zwisch (p ∨ q)zwischzwisch((p ∨ q) ⊃ ¬r)zwisch
(p, q, and r are true)
(p and q are true, r is false)
(p and r are true, q is false)
(p is true, q and r are false)
(p is false, q and r are true)
(p and r are false, q is true)
(p and q are false, r is true)
(p, q, and r are false)


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.

Additional material for week 4

The material can be found on the page Semantics 1, SoSe 2016 (Sailer): Week 4


Additional material for week 3

The material for week 3 can be accessed here


Retrieved from "http:///wiki/index.php?title=Semantics_1,_SoSe_2016_(Sailer)&oldid=6520"