SoSE15: Term paper project: Determiners: Difference between revisions
Monique Lanz (talk | contribs) |
Monique Lanz (talk | contribs) |
||
Line 94: | Line 94: | ||
'''Task 1 | '''Task 1:''' Identify the correct formula for this paraphrase. | ||
<quiz display=simple> | <quiz display=simple> | ||
{ | {Every reindeer which eats carrots sings. | ||
|type="()"} | |type="()"} | ||
- ''∀x (reindeer<sub>1</sub>(x) : (eat-carrots<sub>1</sub>(x) ∧ sing<sub>1</sub>(x)))'' | - ''∀x (reindeer<sub>1</sub>(x) : (eat-carrots<sub>1</sub>(x) ∧ sing<sub>1</sub>(x)))'' | ||
Line 123: | Line 104: | ||
+ ''∀x ((reindeer<sub>1</sub>(x) ∧ eat-carrots<sub>1</sub>(x)) : sing<sub>1</sub>(x))'' | + ''∀x ((reindeer<sub>1</sub>(x) ∧ eat-carrots<sub>1</sub>(x)) : sing<sub>1</sub>(x))'' | ||
{ | {A snowman loves summer. | ||
|type="()"} | |type="()"} | ||
- ''love<sub>2</sub>((∃x snowman<sub>1</sub>(x)), summer)'' | - ''love<sub>2</sub>((∃x snowman<sub>1</sub>(x)), summer)'' | ||
Line 129: | Line 110: | ||
- ''∃x (snowman<sub>1</sub>(x) : love<sub>2</sub>(summer))'' | - ''∃x (snowman<sub>1</sub>(x) : love<sub>2</sub>(summer))'' | ||
{ | {The iceman loves a princess. | ||
|type="()"} | |type="()"} | ||
- ''∃x (princess<sub>1</sub>(x) : love<sub>2</sub>(iceman, x) | - ''∃x (princess<sub>1</sub>(x) : love<sub>2</sub>(iceman, x)'' | ||
+ ''∃x (princess<sub>1</sub>(x) : love<sub>2</sub>((ιy : iceman<sub>1</sub>(y)), x)) | + ''∃x (princess<sub>1</sub>(x) : love<sub>2</sub>((ιy : iceman<sub>1</sub>(y)), x))'' | ||
- ''ιx : (iceman<sub>1</sub>(x) ∧ love<sub>2</sub>(x, ∃y (princess<sub>1</sub>(y)))) | - ''ιx : (iceman<sub>1</sub>(x) ∧ love<sub>2</sub>(x, ∃y (princess<sub>1</sub>(y))))'' | ||
</quiz> | </quiz> | ||
'''Task 2:''' Write down the logical formulae for the following sentences. | |||
(a) Some reindeer is male and royal. | |||
(b) The snowman sings. | |||
(c) Every queen likes Anna. | |||
<div class="toccolours mw-collapsible mw-collapsed" style="width:800px"> | |||
Check your solutions here: | |||
<div class="mw-collapsible-content"> | |||
(a) ''∃x (reindeer<sub>1</sub>(x) : (male<sub>1</sub>(x) ∧ royal<sub>1</sub>(x)))'' | |||
(b) ''sing<sub>1</sub>(ιx : snowman<sub>1</sub>(x))'' | |||
(c) ''∀x (queen<sub>1</sub>(x) : like<sub>2</sub>(x, Anna))''</div> | |||
</div> | |||
= Participants = | = Participants = |
Revision as of 15:38, 21 August 2015
Warning:
The material on this page has been created as part of a seminar. It is still heavily under construction and we do not guarantee its correctness. If you have comments on this page or suggestions for improvement, please contact Manfred Sailer.
This note will be removed once the page has been carefully checked and integrated into the main part of this wiki.
Short description of the project
- Difference between "every", "some" and the definite article;
- Video about how to differentiate "some" and the definite article;
- Three exercises for each operator
The difference between the logical quantifiers and definite descriptions
The universal and existential quantifiers have to be interpreted differently than the definite article.
The universal quantifier (every, all → ∀) indicates that every single individual in a model that has the features of the restrictor, also has the features of the scope.
The existential quantifier (some, a → ∃) states that there is at least one individual or more in a model that has both the features of the restrictor and the scope.
The definite article (the → ⍳) states that there is absolutely one individual and no more or less in a model that fits exactly the described features.
Model from the scenario "Frozen"
Individuals:
- Elsa, the Snow Queen of Arendelle
- Anna, the Princess of Arendelle
- Kristoff, an iceman
- Sven, a reindeer
- Olaf, a snowman
- Hans, the Prince of the Southern Isles
Properties:
- royal1 = {<x> | x is royal} = {<Elsa>, <Anna>, <Hans>}
- prince1 = {<x> | x is a prince} = {<Hans>}
- human1 = {<x> | x is human} = {<Elsa>, <Anna>, <Kristoff>, <Hans>}
- male1 = {<x> | x is male} = {<Kristoff>, <Sven>, <Olaf>, <Hans>}
Relations:
- sibling2 = {<x, y> | x and y are siblings} = {<Elsa, Anna>, <Anna, Elsa>}
- get-engaged2 = {<x, y> | x and y get engaged} = {<Anna, Hans>, <Hans, Anna>}
Example for the universal quantifier
Example: Every royal is human.
Here, every is our determiner, royal is our restrictor and human is the scope. We will choose x as our variable. Therefore, the paraphrase would look like that:
For every x such that x is royal x is human.
The overall formula for this expression would look like that:
∀ x (royal1(x) : human1(x))
Now we will interpret our formula, so we have to check the truth values for all our individuals in the model:
g(x) | royal1(x) | human1(x) |
---|---|---|
Elsa | ✓ | ✓ |
Anna | ✓ | ✓ |
Kristoff | x | ✓ |
Sven | x | x |
Olaf | x | x |
Hans | ✓ | ✓ |
Since every character that is royal – Elsa, Anna and Hans – is also human the overall formula is true. If not every royal was human, the formula would be false.
The Difference between the existential quantifier and the definite article
Here is a video about how to differentiate the existential quantifier and the definite article:
Exercises
After having read this page and watched the video, work on the following tasks:
Task 1: Identify the correct formula for this paraphrase.
Task 2: Write down the logical formulae for the following sentences.
(a) Some reindeer is male and royal.
(b) The snowman sings.
(c) Every queen likes Anna.
Check your solutions here:
(a) ∃x (reindeer1(x) : (male1(x) ∧ royal1(x)))
(b) sing1(ιx : snowman1(x))
(c) ∀x (queen1(x) : like2(x, Anna))Participants
Back to the Semantics 2 page.