Exercise Syntax of Predicate Logic: Difference between revisions

From Lexical Resource Semantics
Jump to navigation Jump to search
No edit summary
Line 42: Line 42:


<quiz display="simple">
<quiz display="simple">
{}
{Is the following a well-formed formula?}
- '''family-dog'''
- '''family-dog'''
{}
|| '''family-dog''' is just a predicate symbol. It cannot be interpreted as true or false, as its argument is missing. A possible formula would be: '''family-dog'''('''walter''')
|| '''family-dog''' is just a predicate symbol. It cannot be interpreted as true or false, as its argument is missing. A possible formula would be: '''family-dog'''('''walter''')


{}
{Is the following a well-formed formula?}
- '''blonde'''('''alice''','''paul''')
- '''blonde'''('''alice''','''paul''')
|| It cannot be interpreted as true or false. As '''blonde''' is a property and not a relation it can therefore only have one individual as its argument. A possible formula would be: '''blonde'''('''alice''')
|| It cannot be interpreted as true or false. As '''blonde''' is a property and not a relation it can therefore only have one individual as its argument. A possible formula would be: '''blonde'''('''alice''')


{}
{Is the following a well-formed formula?}
+ '''father-of-someone'''('''alice''','''lisa)'''
+ '''father-of-someone'''('''alice''','''lisa)'''


{}
{Is the following a well-formed formula?}
+ '''tall'''('''alice''')
+ '''tall'''('''alice''')


{}
{Is the following a well-formed formula?}
- '''enjoy-watching-football-together'''
- '''enjoy-watching-football-together'''
</quiz>
</quiz>

Revision as of 15:11, 5 May 2013

Formulae without variables

For the following exercises we use names and properties from the The Lord of the Rings novels.

Names: frodo, sam, gandalf, aragorn
1-place predicates: hobbit, wizard
2-place predicates: know, help

1 Click on the items that are well-formed expressions of the semantic representation language.

gandalf
hobbit
sauron
frodogandalf
know(gandalf)
help(aragorn,frodo)

2 Click on the expressions that are well-formed formulae.

hobbit
frodo
hobbit(aragorn)
hobbit(frodo) ∧ wizard(gandalf)
hobbit(frodo) ¬ wizard(sam)


The following material is an adapted form of material created by student participants of the project e-Learning Resources for Semantics (e-LRS).
Involved participants: Lisa, Marthe, Elisabeth, and Isabelle.

This exercise is based on the following scenario:

At the time Alice, Paul, Tom and Lisa live in Berlin, but they rather want to live in Munich. Alice is married to Paul. They are Tom and Lisa's parents. Both Lisa and her father are tall, while Alice and Tom are rather small. Lisa and her mom share the same hair color, which is blonde. The family enjoys watching American football games together. But while the girls also like watching soccer, the boys get bored of it. Walter, the family's dog, doesn't care about sports at all, he likes to eat the familiy members´ shoes.

Which of the following expressions of predicate logic are formulae? Give an explanation for your decision. If the expression is not a formula try to change it into one. To check your answers click on single expressions.

1 Is the following a well-formed formula?

family-dog

2 Is the following a well-formed formula?

blonde(alice,paul)

3 Is the following a well-formed formula?

father-of-someone(alice,lisa)

4 Is the following a well-formed formula?

tall(alice)

5 Is the following a well-formed formula?

enjoy-watching-football-together


For a general explanation of formulae Click here


Formulae with variables

For the following exercises we use names and properties from the The Lord of the Rings novels.

Names: frodo, sam, gandalf, aragorn
1-place predicates: hobbit, wizard
2-place predicates: know, help

1 Click on the items that are well-formed expressions of the semantic representation language.

y
xfrodo
x

2 Click on the expressions that are well-formed formulae.

x (hobbit(x) ⊃ x = gandalf)
y(hobbit(x) ∨ wizard(gandalf))



Back to