Semantics 1, WiSe 2016/17 (Sailer): Difference between revisions
Jump to navigation
Jump to search
Line 4: | Line 4: | ||
* Room: <span style="color:#FF0000">''New!'' '''IG 3.201''' </span> | * Room: <span style="color:#FF0000">''New!'' '''IG 3.201''' </span> | ||
* Olat course: https://olat-ce.server.uni-frankfurt.de/olat/auth/RepositoryEntry/4208361498 | * Olat course: https://olat-ce.server.uni-frankfurt.de/olat/auth/RepositoryEntry/4208361498 | ||
= Material for week 5 = | |||
== Homework == | |||
* Work through this wiki page. | |||
* Read: Levine et al., Chapter 2, Section 2 | |||
* Complex formulae: | |||
:* Give 2 complex formulae with one logical connector each. (Use different connectors) | |||
:* Provide the step-by-step computation of the truth value of your two formulae. | |||
* For the compuation, watch teh video below. | |||
== Video == | |||
The following video presents the step-by-step computation of the truth value of two formulae with connectives. | |||
The example uses a model based on Shakespeare's play ''Macbeth''. | |||
The two formulae are: | |||
* '''¬ king(lady-macbeth)''' | |||
* '''king(duncan) ∨ king(lady-macbeth)''' | |||
<embedvideo service="youtube" dimensions="400">http://youtu.be/ABXPMzHFYxU</embedvideo> | |||
<!-- https://www.youtube.com/watch?v=K14D7VllA8M --> | |||
The next 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. | |||
<embedvideo service="youtube" dimensions="400">http://youtu.be/C1rjU104R54</embedvideo> | |||
= Material for week 4 = | = Material for week 4 = | ||
Line 12: | Line 44: | ||
* Atomic formulae: Using your model from this week's homework, | * Atomic formulae: Using your model from this week's homework, | ||
:* Give 2 atomic formulae (one true, one false) | :* Give 2 atomic formulae (one true, one false) | ||
:* Provide the step-by-step computation of the truth of your 2 atomic formulae. | :* Provide the step-by-step computation of the truth value of your 2 atomic formulae. | ||
* For the computation, watch the videos on the wiki page. | * For the computation, watch the videos on the wiki page. | ||
Revision as of 20:36, 8 November 2016
General information
- Course hours: Tuesday, 8.15-9.45 am
- Room: New! IG 3.201
- Olat course: https://olat-ce.server.uni-frankfurt.de/olat/auth/RepositoryEntry/4208361498
Material for week 5
Homework
- Work through this wiki page.
- Read: Levine et al., Chapter 2, Section 2
- Complex formulae:
- Give 2 complex formulae with one logical connector each. (Use different connectors)
- Provide the step-by-step computation of the truth value of your two formulae.
- For the compuation, watch teh video below.
Video
The following video presents the step-by-step computation of the truth value of two formulae with connectives. The example uses a model based on Shakespeare's play Macbeth. The two formulae are:
- ¬ king(lady-macbeth)
- king(duncan) ∨ king(lady-macbeth)
The next 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.
Material for week 4
Homework
- Work through this wiki page.
- Atomic formulae: Using your model from this week's homework,
- Give 2 atomic formulae (one true, one false)
- Provide the step-by-step computation of the truth value of your 2 atomic formulae.
- For the computation, watch the videos on the wiki page.
Additional material
Check the material on this page: additional material for week 4
Material for week 3
Slides
Slides: File:WiSe1617-Sem1-slides03-final.pdf
Homework
- Work through this wiki page.
- Read Levine et al. (in prep.), Chapter 2, Section 1 [available on olat].
- Define a model and introduce the necessary name symbols and predicate symbols for our scenario with
- three individuals
- two relations
- two properties
- Use your model and your symbols and write down
- one formula that is true in your model and
- two formulae that are false in your model.
Additional material
Check the material on this page: additional material for week 3
Material for week 2
Slides of the meeting: File:Sem1-slides02-final.pdf
Homework
- Read chapter 1 of Levine et al. (in prep.). -> available on Olat
- Find or construct one example sentence per type of ambiguity.
- Get information on our literary scenario Waiting for Godot:
- On wikipedia: https://en.wikipedia.org/wiki/Waiting_for_Godot
- Full text: Act 1, Act 2
- Full play on youtube: https://www.youtube.com/watch?v=Wifcyo64n-w
Material for week 1
Wiki material on ambiguity: Exercise-ch1#Types_of_Ambiguity