Lexical Resource Semantics - User contributions [en]

User:Elisabeth.krall

2018-05-30T16:29:47Z

Elisabeth.krall: Blanked the page

Creation of the World

2013-02-22T10:25:46Z

Elisabeth.krall:

'''The real world'''

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.

'''1.''' Take a look at the story above. Using predicate logic terms and notation we now want to define the world described in the story. First we need our individuals, their relations and possible properties. You will need a pen and paper to write down your answers!''

'''Note:''' As in the textbook, the expressions of the World will be written in italics and the ones of the predicate logic in bold.

'''a.)''' Define the universe described in the “Real World Scenario”. Make sure you use the correct notation.

'''[[AnswerEX1-a|Check your answers]]'''

'''b.)''' Choose three individuals from those mentioned in the story and map them to 3 properties mentioned in the story. Don't forget: empty sets are possible!

'''[[AnswerEX1-b|Check your answers]]'''

'''c.)''' Write down the possible relations mentioned in the story and map them to the individuals you wrote down in a.

'''[[AnswerEX1-c|Check your answers]]'''

'''d.)''' Write down the I-functions (interpretation functions) for a, b and c.'''

'''[[AnswerEX1-d|Check your answers]]'''

====Navigation====

'''[[NMTS-Group9|Link to the Wiki Page]]'''

NMTS-Group9

2013-02-06T10:17:53Z

Elisabeth.krall: /* Our wiki pages */

{{MaterialUnderConstruction}}

= Wikipage of Group 9 =

== Overview ==

=== Members ===
'''[[User:Lisa| Lisa]]''' '''[[User:Marthe| Marthe]]''' '''[[User:Elisabeth.krall| Elisabeth]]''' '''[[User:IsaB|Isabelle]]'''

=== Short description of the topic ===

'''Predicate logic - logical connectives'''

The purpose of Predicate logic is to avoid ambiguity in sentences by forming formulae out of natural language. Logical connectives are used to create formulae out of sentences with "and", "or", "if/then" and "not". The aim is to state if the given sentence is true or false in a given model.

==== Examples ====

===== AND =====

Symbol: Ʌ 
Sentence: Harry is a student and Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>'''student(harry) Ʌ teacher(snape)''']] = ''true/false''

'''Truthtable AND'''

[[File:Truthtable_AND.png|400px]]

===== OR =====

Symbol: V 
Sentence: Harry is a student or Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>'''student(harry) V teacher(snape)''']] = ''true/false''

'''Truthtable OR'''

[[File:Truthtable_OR.png|400px]]

===== IF/THEN =====

Symbol: --> 
Sentence: If Harry is a student then Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>'''student(harry) --> teacher(snape''')]] = ''true/false''

'''Truthtable IF/THEN'''

[[File:Truthtable_IF_THEN.png|400px]]

===== NOT =====

Symbol: ¬ 
Sentence: Harry is not a student. 
Formulae: <nowiki>[[</nowiki>'''¬student(harry)''']] = ''true/false''

The original formulae has to be false, that the overall statement is true.

'''Example:'''
Only if '''student(harry)''' is ''false'', '''¬student(harry''') is ''true''.

==== Difficulties ====
* Abstraction of content/natural language
* Understanding the whole process from creating a model to interpret formulae
* Understanding the truth conditions of a formulae with connectives

== References and links ==

=== References ===

* Course material "Introduction to Semantics" by Manfred Sailer

=== Links ===

* [http://www.philosophy.hku.hk/think/sl Sentential Logic]

* [http://www.philosophy.hku.hk/think/pl Predicate Logic]

= Our e-learning objects =

== Our wiki pages ==


* in the Glossary (only those relevant for our topic):
** [[Glossary:_Predicate| Glossary entry for ''predicate'']]
** [[Glossary:_Formulae| Glossary entry for ''formulae'']]
** [[Glossary:_I-Function| Glossary entry for ''I-Function'']]
** [[Glossary:_G-Function| Glossary entry for ''G-Function'']]
** [[Glossary:_Logical Connectives| Glossary entry for ''Logical Connective'']]

== Our podcasts ==


<mediaplayer>http://youtu.be/KLeSxGJ-FeI</mediaplayer>

== Our material for an interactive whiteboard ==


== Our pictures ==

<gallery>
File:Lisa.jpg|Lisa
File:MartheBerkenheide.jpg|Marthe
File:Picture liss.jpg|Elisabeth
File:IsabelleBrend'amour.jpg|Isabelle

</gallery>

== Our exercises ==


Complex exercise on Predicate Logic:

* [[Creation_of_the_World|Exercise 1: Creation of the World]]

* [[Formulae_and_their_interpretation|Exercise 2: Formulae and their interpretation]]

* [[Interpretation_of_formulae_with_connectives|Exercise 3: Interpretation of formulae with connectives]]

Glossary: Logical Connectives

2013-02-05T22:21:16Z

Elisabeth.krall: Created page with "{{MaterialUnderConstruction}} = Logical Connectives = == Definition == Logical connectives are the conjunction ''and'', the disjunction ''or'', and the implication ''if......"

{{MaterialUnderConstruction}}

= Logical Connectives =

== Definition ==

Logical connectives are the conjunction ''and'', the disjunction ''or'', and the implication ''if...then'''. In the course of our topic, we also regard the negation ''not'' as a logical connective. They are used in order to connect atomic formulae in logical language, i.e. atomic sentences in natural language.

== Examples ==

The following examples refer to the scenario given in the online exercises.

Paul rather wants to live in Munich and Alice is small.

Complex formula: '''rather-wants-to-live-in-Munich (paul) Ʌ small (alice)'''

Walter is a dog or Tom is not blonde.

Complex formula: '''dog (walter) V ¬ blonde (tom)'''

== References ==

* [[NMTS-Group9| Group page 9: Predicate Logic]]

== Literature ==

* Chapter 2 of Manfred Sailer's textbook

Glossary: G-Function

2013-02-05T22:06:34Z

Elisabeth.krall: /* Examples */

{{MaterialUnderConstruction}}

= G-Function =

== Definition ==

The G-Function in Predicate Logic maps variables to individuals from the universe. In natural, real-world language we use variable, such as personal pronouns, instead of repeating the names constantly that are referred to. In order to, firstly, display and, then, interpret sentences with pronouns , the G-Function is applied.

== Examples ==

The following examples refer to the scenario given in the online exercises.

Alice likes watching soccer together with Lisa.

--> I-Function: '''like-watching-soccer-together-with (alice, lisa)'''

But: She likes watching soccer together with her.

--> G-Function: g('''x''')= <''alice'''> and g('''y''')= <''lisa''>

--> Formula can be formed: '''like-watching-soccer-together-with (x,y)'''

== References ==

* [[NMTS-Group9| Group page 9: Predicate Logic]]

== Literature ==

* Chapter 2 of Manfred Sailer's textbook

Glossary: G-Function

2013-02-05T22:02:53Z

Elisabeth.krall: Created page with "{{MaterialUnderConstruction}} = G-Function = == Definition == The G-Function in Predicate Logic maps variables to individuals from the universe. In natural, real-world lan..."

{{MaterialUnderConstruction}}

= G-Function =

== Definition ==

The G-Function in Predicate Logic maps variables to individuals from the universe. In natural, real-world language we use variable, such as personal pronouns, instead of repeating the names constantly that are referred to. In order to, firstly, display and, then, interpret sentences with pronouns , the G-Function is applied.

== Examples ==

The following examples refer to the scenario given in the online exercises.

Alice likes watching soccer together with Lisa.

--> I-Function: '''like-watching-soccer-together-with (alice, lisa)'''

But: She likes watching soccer together with her.

--> G-Function: g('''x''')= <''alice'''> g('''y''')= <''lisa''>

--> Formula can be formed: '''like-watching-soccer-together-with (x,y)'''

== References ==

* [[NMTS-Group9| Group page 9: Predicate Logic]]

== Literature ==

* Chapter 2 of Manfred Sailer's textbook

Glossary: I-Function

2013-02-05T21:52:59Z

Elisabeth.krall: /* Examples */

{{MaterialUnderConstruction}}

= I-Function =

== Definition ==

The I-Function used in Predicate Logic maps each name of logical language to one individual from the universe. In this sense, it maps individuals to properties and sets of individuals to relations.

== Examples ==

The following examples refer to the scenario given in the online exercises.

Names:

I('''walter''')= <''walter''>
I('''lisa''')= <''lisa''>

Properties:

I('''tall''')= <''tom''>
I('''blonde''')= <''lisa''>; <''alice''>

Relations:

I('''being-married''')= <''alice,paul''>; <''paul,alice''>

== References ==

* [[NMTS-Group9| Group page 9: Predicate Logic]]

== Literature ==

* Chapter 2 of Manfred Sailer's textbook

Glossary: I-Function

2013-02-05T21:48:27Z

Elisabeth.krall: /* Examples */

{{MaterialUnderConstruction}}

= I-Function =

== Definition ==

The I-Function used in Predicate Logic maps each name of logical language to one individual from the universe. In this sense, it maps individuals to properties and sets of individuals to relations.

== Examples ==

The following examples refer to the scenario given in the online exercises.

Names:

I(walter)= walter
I(lisa)= lisa

Properties:

I(tall)= tom
I(blonde)= lisa; alice

Relations:

I(being-married)= <alice,paul>; <paul,alice>

== References ==

* [[NMTS-Group9| Group page 9: Predicate Logic]]

== Literature ==

* Chapter 2 of Manfred Sailer's textbook

Glossary: I-Function

2013-02-05T21:43:53Z

Elisabeth.krall: /* References */

Glossary: I-Function

2013-02-05T21:43:15Z

Elisabeth.krall: Created page with "{{MaterialUnderConstruction}} = I-Function = == Definition == The I-Function used in Predicate Logic maps each name of logical language to one individual from the universe..."

NMTS-Group9

2013-02-05T21:40:30Z

Elisabeth.krall: /* Our wiki pages */

{{MaterialUnderConstruction}}

= Wikipage of Group 9 =

== Overview ==

=== Members ===
'''[[User:Lisa| Lisa]]''' '''[[User:Marthe| Marthe]]''' '''[[User:Elisabeth.krall| Elisabeth]]''' '''[[User:IsaB|Isabelle]]'''

=== Short description of the topic ===

'''Predicate logic - logical connectives'''

The purpose of Predicate logic is to avoid ambiguity in sentences by forming formulae out of natural language. Logical connectives are used to create formulae out of sentences with "and", "or", "if/then" and "not". The aim is to state if the given sentence is true or false in a given model.

==== Examples ====

===== AND =====

Symbol: Ʌ 
Sentence: Harry is a student and Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>'''student(harry) Ʌ teacher(snape)''']] = ''true/false''

'''Truthtable AND'''

[[File:Truthtable_AND.png|400px]]

===== OR =====

Symbol: V 
Sentence: Harry is a student or Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>'''student(harry) V teacher(snape)''']] = ''true/false''

'''Truthtable OR'''

[[File:Truthtable_OR.png|400px]]

===== IF/THEN =====

Symbol: --> 
Sentence: If Harry is a student then Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>'''student(harry) --> teacher(snape''')]] = ''true/false''

'''
Truthtable IF/THEN'''

[[File:Truthtable_IF_THEN.png|400px]]

===== NOT =====

Symbol: ¬ 
Sentence: Harry is not a student. 
Formulae: <nowiki>[[</nowiki>'''¬student(harry)''']] = ''true/false''

The original formulae has to be false, that the overall statement is true.

'''Example:'''
Only if student(harry) is false, ¬student(harry) is true .

==== Difficulties ====
* Abstraction of content/natural language
* Understanding the whole process from creating a model to interpret formulae
* Understanding the truth conditions of a formulae with connectives

== References and links ==

=== References ===

* Course material "Introduction to Semantics" by Manfred Sailer

=== Links ===

* [http://www.philosophy.hku.hk/think/sl Sentential Logic]

* [http://www.philosophy.hku.hk/think/pl Predicate Logic]

= Our e-learning objects =

== Our wiki pages ==


* in the Glossary (only those relevant for our topic):
** [[Glossary:_Predicate]]: the entry for ''predicate''
** [[Glossary:_Formulae]]: the entry for ''formulae''
** [[Glossary:_I-Function]]: the entry for ''I-Function''
** [[Glossary:_G-Function]]: the entry for ''G-Function''
** [[Glossary:_Logical Connectives]]: the entry for ''Logical Connectives''

== Our podcasts ==


<mediaplayer>http://youtu.be/KLeSxGJ-FeI</mediaplayer>

== Our material for an interactive whiteboard ==


== Our pictures ==

<gallery>
File:Lisa.jpg|Lisa
File:MartheBerkenheide.jpg|Marthe
File:Picture liss.jpg|Elisabeth
File:IsabelleBrend'amour.jpg|Isabelle

</gallery>

== Our exercises ==


Complex exercise on Predicate Logic:

* [[Creation_of_the_World|Exercise 1: Creation of the World]]

* [[Formulae_and_their_interpretation|Exercise 2: Formulae and their interpretation]]

* [[Interpretation_of_formulae_with_connectives|Exercise 3: Interpretation of formulae with connectives]]

AnswerEX2-a2

2013-01-27T18:08:27Z

Elisabeth.krall: /* blonde(Alice,Paul) is not a formula */

==''blonde(Alice,Paul)'' is '''not''' a formula==

It cannot be interpreted as true or false. As “blonde” is a property and not a relation it can therefore only have one individual in brackets.
A possible formula would be: ''blonde(alice)''

====Navigation====

*[[Formulae_and_their_interpretation|Link to the current exercise]]

AnswerEX2-a1

2013-01-27T18:08:10Z

Elisabeth.krall: /* family-dog is not a formula */

==''family-dog'' is '''not''' a formula==

It cannot be interpreted as true or false, as an individual is missing.
A possible formula would be: ''family dog (walter)''

====Navigation====
*[[Formulae_and_their_interpretation|Link to the current exercise]]

Formulae and their interpretation

2013-01-27T18:07:52Z

Elisabeth.krall:

'''2 a)''' 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 the single expressions.""

'''*[[AnswerEX2-a1|''family dog'']]'''

'''*[[AnswerEX2-a2|''blonde(alice,paul)'']]'''

'''*[[AnswerEX2-a3|''father of someone(alice,lisa'')]]'''

'''*[[AnswerEX2-a4|''tall(alice)'']]'''

'''*[[AnswerEX2-a5|''enjoy watching football together'']]'''

For a general explanation of formulae [[General_Explanation_Formulae|Click here]]

'''b)''' Interpret the following formulae as true or false. If you have not defined these relations or properties in your World use the ones given in the World of Task 1d). [[AnswerEX1-d|See here]]
To check your answers click on the single formulae.

'''* [[AnswerEX2-b1|''father of someone(paul,lisa'')]]'''

'''* [[AnswerEX-b2|''blonde(walter)'']]'''

'''* [[AnswerEX-b3|''enjoy watching football together(alice,tom)'']]'''

====Navigation====

'''[[NMTS-Group9|Link to the Wiki Page]]'''

AnswerEX3-b

2013-01-27T18:05:54Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

[[¬daughter-of-someone (tom,paul) v tall(tom)]] = TRUE 

because [[¬daughter-of-someone (tom,paul)]]= TRUE 

::because I(tom)= tom, I(paul)=paul and <tom, paul> is NOT an element of I(daughter-of-someone) 

and [[tall(tom)]] = FALSE 

::because I(tom)= tom and <tom> is NOT an element of the set I(tall). 

'''Disjunction (v)''': At least one of the atomic formulae has to be true in order for the complex formula to be true.

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-b

2013-01-27T18:05:39Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

[[¬daughter-of-someone (tom,paul)v tall(tom)]] = TRUE 

because [[¬daughter-of-someone (tom,paul)]]= TRUE 

::because I(tom)= tom, I(paul)=paul and <tom, paul> is NOT an element of I(daughter-of-someone) 

and [[tall(tom)]] = FALSE 

::because I(tom)= tom and <tom> is NOT an element of the set I(tall). 

'''Disjunction (v)''': At least one of the atomic formulae has to be true in order for the complex formula to be true.

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-a

2013-01-27T18:05:14Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

because [[dog (walter)]]= TRUE 

::because I(walter)= walter and <walter> is an element of the set I(dog) 

but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

::because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together). 

'''Conjunction (Ʌ)''': Both atomic formulae have to be true in order for the complex formula to be true.

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-a

2013-01-27T18:04:50Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

because [[dog (walter)]]= TRUE 

::because I(walter)= walter and <walter> is an element of the set I(dog) 

but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

::because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together). 

Conjunction (Ʌ): Both atomic formulae have to be true in order for the complex formula to be true.

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-b

2013-01-27T18:02:48Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

[[¬daughter-of-someone (tom,paul)v tall(tom)]] = TRUE 

because [[¬daughter-of-someone (tom,paul)]]= TRUE 

::because I(tom)= tom, I(paul)=paul and <tom, paul> is NOT an element of I(daughter-of-someone) 

and [[tall(tom)]] = FALSE 

::because I(tom)= tom and <tom> is NOT an element of the set I(tall). 

Disjunction (v): At least one of the atomic formulae has to be true in order for the complex formula to be true.

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-a

2013-01-27T17:54:37Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

because [[dog (walter)]]= TRUE 

::because I(walter)= walter and <walter> is an element of the set I(dog) 

but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

::because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together). 

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-b

2013-01-27T17:54:05Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

because [[dog (walter)]]= TRUE 

::because I(walter)= walter and <walter> is an element of the set I(dog) 

but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

::because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together). 

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

Interpretation of formulae with connectives

2013-01-27T17:46:37Z

Elisabeth.krall:

TASK 3: Consider those two natural language sentences. While keeping in the mind the scenario given in exercise 1, create comlex formula with logical connectives and compute the interpretation, respectively.

a. Walter is a dog and lisa and tom enjoy watching soccer together.

'''[[AnswerEX3-a|Check your solution here]]'''

b. Tom is not Paul's daughter or Tom is tall.

'''[[AnswerEX3-b|Check your solution here]]'''

====Navigation====

'''[[NMTS-Group9|Link to the Wiki Page]]'''

AnswerEX3-b

2013-01-27T17:46:14Z

Elisabeth.krall: Created page with "Here the interpretation in predicate logic notation: dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom) = FALSE because dog (walter)= TRUE be..."

Here the interpretation in predicate logic notation:

[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

because [[dog (walter)]]= TRUE 

because I(walter)= walter and <walter> is an element of the set I(dog) 

but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together). 

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-a

2013-01-27T17:38:09Z

Elisabeth.krall:

AnswerEX3-a

2013-01-27T17:32:21Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

<nowiki>[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

because [[dog (walter)]]= TRUE 

because I(walter)= walter and <walter> is an element of the set I(dog) 

but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE 

because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together). 

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-a

2013-01-27T17:25:06Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

<nowiki>[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE

because [[dog (walter)]]= TRUE

because I(walter)= walter and <walter> is an element of the set I(dog)

but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE

because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together).

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-a

2013-01-27T17:24:27Z

Elisabeth.krall:

Here the interpretation in predicate logic notation:

<nowiki>[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE

*because [[dog (walter)]]= TRUE

*because I(walter)= walter and <walter> is an element of the set I(dog)

*but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE

*because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together).

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-a

2013-01-27T17:23:29Z

Elisabeth.krall:

<nowiki>[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE

*because [[dog (walter)]]= TRUE

*because I(walter)= walter and <walter> is an element of the set I(dog)

*but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE

*because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together).

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-a

2013-01-27T17:22:38Z

Elisabeth.krall:

<nowiki>[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE

because [[dog (walter)]]= TRUE

because I(walter)= walter and <walter> is an element of the set I(dog)

but [[enjoy-watching-soccer-together (lisa,tom)]] = FALSE

because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together).

====Navigation====

*[[Interpretation_of_formulae_with_connectives|Link to the current exercise]]

AnswerEX3-a

2013-01-27T17:20:55Z

Elisabeth.krall:

AnswerEX3-a

2013-01-27T17:20:16Z

Elisabeth.krall:

<nowiki>[[dog (walter) Ʌ enjoy-watching-soccer-together (lisa,tom)]] = FALSE

because <nowiki>[[dog (walter)]]= TRUE

because I(walter)= walter and <walter> is an element of the set I(dog)

but <nowiki>[[enjoy-watching-soccer-together (lisa,tom)]] = FALSE

because I(lisa)= lisa, I(tom)= tom and <lisa,tom> is NOT an element of the set I(enjoy-watching-soccer-together).

AnswerEX3-a

2013-01-27T17:14:38Z

Elisabeth.krall: Created page with "<nowiki>dog(walter)"

<nowiki>[[dog(walter)]]

Interpretation of formulae with connectives

2013-01-27T17:13:46Z

Elisabeth.krall:

TASK 3: Consider those two natural language sentences. While keeping in the mind the scenario given in exercise 1, create comlex formula with logical connectives and compute the interpretation, respectively.

a. Walter is a dog and lisa and tom enjoy watching soccer together.

'''[[AnswerEX3-a|Check your solution here]]'''

b. Tom is Paul's daughter or Tom is tall.

'''[[AnswerEX3-b|Check your solution here]]'''

====Navigation====

'''[[NMTS-Group9|Link to the Wiki Page]]'''

Interpretation of formulae with connectives

2013-01-27T17:11:49Z

Elisabeth.krall:

TASK: Consider those two natural language sentences. While keeping in the mind the scenario given in exercise 1, create comlex formula with logical connectives and compute the interpretation, respectively.

1. Walter is a dog and lisa and tom enjoy watching soccer together.

2. Tom is Paul's daughter or Tom is tall.

====Navigation====

'''[[NMTS-Group9|Link to the Wiki Page]]'''

Interpretation of formulae with connectives

2013-01-27T17:11:01Z

Elisabeth.krall:

Interpretation of formulae with connectives

2013-01-27T17:09:53Z

Elisabeth.krall: Created page with "TASK: Consider those two natural language sentences. While keeping in the mind the scenario given in exercise 1, create comlex formula with logical connectives and compute the..."

AnswerEX2-b1

2013-01-25T13:50:07Z

Elisabeth.krall:

father of someone (paul,lisa) = true,

because

I(paul) = {paul},

I(lisa) = {lisa}

and

<paul,lisa> '''is''' a set of I(father of someone).

====Navigation====

*[[Formulae_and_their_interpretation|Link to the current exercise]]

AnswerEX2-b1

2013-01-25T13:48:18Z

Elisabeth.krall:

<nowiki>[[father of someone (paul,lisa)]] = true,

because

I(paul) = {paul},

I(lisa) = {lisa}

and

<paul,lisa> '''is''' a set of I(father of someone).

====Navigation====

*[[Formulae_and_their_interpretation|Link to the current exercise]]

NMTS-Group9

2013-01-25T13:25:10Z

Elisabeth.krall: /* Our exercises */

{{MaterialUnderConstruction}}

= Wikipage of Group 9 =

== Overview ==

=== Members ===
[[User:Lisa| Lisa]] [[User:Marthe| Marthe]] [[User:Elisabeth.krall| Elisabeth]] [[User:IsaB|Isabelle]]

=== Short description of the topic ===

'''Predicate logic - logical connectives'''

The purpose of Predicate logic is to avoid ambiguity in sentences by forming formulae out of natural language. Logical connectives are used to create formulae out of sentences with "and", "or", "if/then" and "not". The aim is to state if the given sentence is true or false in a given model.

==== Examples ====
===== and =====
Symbol: Ʌ 
Sentence: Harry is a student and Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) Ʌ teacher (snape)]] = true/false

===== or =====
Symbol: V 
Sentence: Harry is a student or Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) V teacher (snape)]] = true/false

===== if/then =====
Symbol: --> 
Sentence: If Harry is a student then Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) --> teacher (snape)]] = true/false

===== not =====
Symbol: ¬ 
Sentence: Harry is not a student. 
Formulae: <nowiki>[[</nowiki>¬student (harry)]] = true/false

==== Difficulties ====
* Abstraction of content/natural language
* Understanding the whole process from creating a model to interpret formulae
* Understanding the truth conditions of a formulae with connectives

== References and links ==

=== References ===

* Course material "Introduction to Semantics" by Manfred Sailer

=== Links ===

* [http://www.philosophy.hku.hk/think/sl Sentential Logic]

* [http://www.philosophy.hku.hk/think/pl Predicate Logic]

= Our e-learning objects =

== Our wiki pages ==


* in the Glossary:
** [[Glossary:Hyponym]]: the entry for ''hyponym''
** [[Glossary:_Predicate]]: the entry for ''predicate''
** [[Glossary:_Formulae]]: the entry for ''formulae''
** [[Glossary:_Connotation]]: the entry for ''connotation''

== Our podcasts ==


== Our material for an interactive whiteboard ==


== Our pictures ==

<gallery>
File:Lisa.jpg|Lisa
File:MartheBerkenheide.jpg|Marthe
File:Picture liss.jpg|Elisabeth
File:IsabelleBrend'amour.jpg|Isabelle

</gallery>

== Our exercises ==


Complex exercise on Predicate Logic:

* [[Creation_of_the_World|Exercise 1: Creation of the World]]

* [[Formulae_and_their_interpretation|Exercise 2: Formulae and their interpretation]]

* [[Interpretation_of_formulae_with_connectives|Exercise 3: Interpretation of formulae with connectives]]

Creation of the World

2013-01-25T13:14:15Z

Elisabeth.krall:

Marthe´s Aufgabe

The real world

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 their shoes.

1.)

Take a look at the story above. Using predicate logic terms and notation we now want to define the world described in the story. First we need our individuals, their relations and possible properties.

a.) Define the universe described in the “Real World Scenario”. Make sure you use the correct notation.

b.) Choose three individuals from those mentioned in the story and map them to 3 of the properties mentioned in the story. Don't forget: empty sets are possible!

c.) Write down the possible relations mentioned in the story and map them to the individuals you wrote down in a.

====Navigation====

[[NMTS-Group9|Link to the Wiki Page]]

NMTS-Group9

2013-01-19T17:27:08Z

Elisabeth.krall: /* Our materials for an interactive whiteboard */

NMTS-InferencePage

2012-12-02T21:40:51Z

Elisabeth.krall:

{{MaterialUnderConstruction}}

= Homework of November 27 =

== Task ==

Come up with or report a short dialogue and use it to illustrate:
# one entailment
# one presupposition (what is the trigger? what kind of presupposition is it?)
# one implicature (what kind of implicature is it? show the calculation by applying the maxims in the case of conversational implicatures)

== Dialogues ==

=== Dialogue by [[User:Manfred]] ===

The following passage is taken from David Mitchell ''Cloud Atlas'', London: Sceptre, 2004, p.33f. 
(Comment: this is not a real dialogue, but the text is clear enough so that it is easy to see what has been said in the described situtation.)

# Along the gangway I stepped (''Prophetess'' was bucking like a 
# young bronco) to the officers' mess, knocked & entered. Mr 
# Roderick & Mr Boerhaave were listening to Cpt. Molyneux. I 
# cleared my throat and bade all good morning, at which our ami- 
# cable captain swore, `You can better my morning by b-ing 
# off, instanter!´
#
# Coolly, I asked ''when'' the captain might find time to hear news 
# of an Indian stowaway who had just emerged from the coils of 
# hawser taking up my `so-called cabin´. During the ensuing silence 
# Cpt. Molyneux's pale, horny-toad complexion turned roast beef 
# pink. Ere his blast was launched, I added the stowaway claimed 
# to be an able-seaman & begged to work his passage.

'''Entailment:'''
Line 4: ''I bade all good morning'' entails ''I said something''

'''Presupposition:'''
Lines 8/9: ''hear news of an Indian stowaway ...''. Presupposes: ''there is an Indian stowaway ...''. 
Type of presuppostion: factive 
Note 1: it is remarkable that in this case the presupposition projects over a modal (''might'') and an embedded question (''when ...''). 
Note 2: the factive presupposition with ''hear'' is not as strong as with ''know'', ''realize'' or the other predicates discussed in class. 
Note 3: In line 12, the verb ''claim'' is used. Its complement clause's content (''the stowaway is an able-seamben'') is not presupposed.

'''Implicature:'''
Lines 10: ''my so-called cabin''. Implicature: ''my cabin is not a proper cabin (because of all the stored hawser)''
 
Type of implicature: particularized conversational implicature. 
Calculation: The maxim of manner seems to be flouted (''be brief'') by the apperantly superfluous ''so-called''. The addressee understands that the speaker wants to communicate more than just saying that the stowaway was in his cabin. The attribute ''so-called'' indicates that the object does not fully satisfy the criteria of what would count as a real cabin.

=== Add your dialogues here ===

== Dialogue by [[User:Nicki]]==

#A1: I dreamed I had won a million dollars.
#B1: That’s a pitty. My neighbor actually won 5000 dollars last week in the lottery.
#A1: Really that’s amazing. By the way, is the apartment next to you still for sale?
#B1: The owner just removed the ‘for-sale’-sign yesterday.

'''Entailment:'''

Line 2: 
Entailment: B1 has a neighbor.

'''Presupposition:'''

Line 1: 
Non-factive presuppostion: A1 did not win a million dollars.

'''Impliciture:'''

Line 4: 
Conversational impliciture: There is no “for sale” sign anymore, so the apartment is sold.

== Dialogue by [[User:Anna P.]] ==

Taken from The Big Bang Theory, Season 6 Episode 4 "The Re-Entry Minimization". 

#'''Howard:''' Hey Ma, twinkle twinkle! You’re little star is home!
#(Tries to open the door, but fails) Ma, the chain is on the door!
#'''Howard's Mom:''' Howard? I thought I don’t get to see you until tomorrow.
#'''Howard:''' Yeah well, Bearny is not feeling well so I thought I stop by.
#Tell you about the greatest adventure of my life.
#See if you can make me feel bad about it.
#'''His Mom:''' Oh ok, hold on. I’m not decent.
#'''Howard:''' Alright. (To himself) Woman hasn’t tied her robe in 20 years
#suddenly she is not decent.
#'''Dr. Schneider:''' Want me to hide in the closet or go out the back?
#'''Howard’s Mom:''' Shhhh… you need to whisper!
#'''Howard:''' Ma, who’s in there?
#'''Howard’s Mom:''' Ah no body… the TV is on.
#'''Dr. Schneider:''' I only got one sock. Where is my other sock?
#'''Howard:''' Who is it?
#'''Howard’s Mom:''' I told you it’s the TV. James Leno lost his sock,
#It’s hilarious.
#'''Howard:''' If you’re busy, I can come back.
#'''Howard’s Mom:''' Just gimme a second! (To Mr. Schneider) Go go go!!
#(Dr. Schneider climbs out of the window. Howard catches him)
#'''Howard:''' Dr. Schneider?
#'''Dr. Schneider:''' Oh… (as if nothing had happen) Hello, Howard!
#'''Howard:''' What are you doing here?
#'''Dr. Schneider:''' Uhm, house call!
#'''Howard:''' You’re a dentist!
#'''Dr. Schneider:''' Yes, yes I am. (Turning toward the house, yelling at
#Howard’s Mom) I think he’s on to us!
 
'''Entailment:''' 
Line 7: ''I'm not decent.'' entails that Howard's mom needs to dress first before she can attend to her son.

'''Presupposition:''' 
Line 6: ''See if you can make me feel bad about it.'' presupposes that his mother usually is giving Howard a hard time. 
Type of presupposition: factive.

'''Implicature:''' 
Line 8/9: ''Woman hasn’t tied her robe in 20 years suddenly she is not decent.'' Particularized conversational implicature. Seems to violate the maxim of relevance but still inference is made due to the fact that Howard's utterance is highly ironical, even sarcastic.

== Dialogue by [[User:Lorena]] ==

1. '''Tim:''' "Why didn´t you come to John´s party last Saturday night? 
2. Most of our friends were there." 
3. '''Kevin:''' "Well, if I hadn´t had to pick my parents from the airport... 
4. I heavily regret that I couldn´t be there." 
5. '''Tim:''' "I see. Your parents were on holiday, I guess." 
6. '''Kevin:''' " Yes, exactly." 
 
1. '''''structural presupposition:''''' Tim presupposes that the Kevin knows that there was a party on the particular place and time mentionend. This part of information is assumed to be true, so he can ask a question that contains these given facts. 
 
2. '''''scalar implicature:''''' Tim expresses how many friends there were at the party. He implicates that there were more than many, but less than all friends there. 
'''''entailment:''''' If Tim´s first sentence is true, than his second one is also true; i.e. If there was a party and he went there, it is likely that he also met friends there. 
 
3. '''''counterfactual presupposition:''''' The opposite of Kevin´s utterance is true - he had to pick his parents from the airport. 
Furthermore, his utterance serves as an explanation for his absence and implicates that if he hadn´t had to fetch them, he would have been at the party. 
 
4. '''''factive presupposition:''''' The verb ''regret'' emphasizes the fact of his absence. But it also expresses that he could have been there. 
 
5. '''''hedge''''' (I guess) concerning the maxim of quality of the cooperative principle: Tim conveys that he is not quite sure if his friend´s parents were abroad. The usage of this cautious note indicates that his inference might not be accurate.

== Dialogue by [[User:Lisa]]==

# Lisa and Verena are chatting during a lecture. 
# Lisa says: "I really regret havig taken this course." 
# Verena nodds and asks: "How is your dog?" 
# "Oh she is fine. But yesterday she drove me crazy. 
# She chased a cat and ran into a garden!"

'''Entailment:'''

Line 1: 
Lisa is talking. Verena is talking.

'''Presupposition:'''

Line 2: "I regret having taken this course" presupposes that Lisa took the course. The presupposed information following the verb "regret" can be treated as a fact. Therefore, it is a factive presuppostion.

Line 3: "How is your dog" presupposes that Lisa has a dog. Explanation as in 2.

'''Implicature:'''

Line 5: "...chased a cat and ran into a garden!" Implicature: It was not Lisa´s cat or garden. She does not know to whom both belongs. Here, no special knowledge is required in the context to calculate the additional conveyed meaning. If Lisa was capable of being more specific she would have said "my garden/cat" or " the garden/cat of xy" (following the maxim of quantity). Therefore, it is a generalized conversational implicature.

== Dialogue by [[User:AnKa]] ==

1. '''A:''' We have many teachers in our school. 
2. '''B:''' Is there a male English teacher at your school? 
3. '''A:''' The class next door has a male teacher. 

Line 1:
'''Entailment:'''
A has at least some teachers in her/his school.

Line 2:
'''Presupposition:'''
Either there is a male English teacher at the school or there isn’t. It is a question.

Line 3:
'''Implicature'''
Conversational Implicature: Maxim of Quality. The Speaker does not want to give a precise answer because he might be uncertain.

== Dialogue by [[User:Moonhwa9113]] ==

1. '''Tom:''' “Good morning Mary, did you sleep well?” 
2. '''Mary:''' “Not really. I dreamt I was a rat. It was awful” 
3. '''Tom:''' “This might sound odd but I think I heard you squeaking last night.” 

'''Entailment:'''
Line 1 entails that Mary had been sleeping.

'''Presupposition:'''
In line 2 Mary explains she dreamt she was a rat which proves she isn’t in real-life. Hence it forms a non-factive presupposition.

'''Implicature'''
In line 3 we see that the speaker Tom hedges (maxim of quality) while he carefully admits to have heard Mary squeaking but is either not sure or simply does not want to embarrass her.

== Dialogue by [[User:Elisabeth.krall]] ==

1. Tom: How did you like the concert?

2. Tim: I don’t know. I was not really getting into the flow of those reggae beats.

3. Tom: Oh, I can see your point. But still I do not regret having bought those over-priced tickets.

4. Tim: Yeah, me neither. The tonality was neither in the Aeolian mode nor in Ionic as I expected it to be for I play reggae myself and the guitar chords would have sounded a lot better openly than in power chords and the bass guitar always emphasized the forth and the seventh instead of the third and the quint, though.

5. Tom: Ohhh… yes, if you say so.

'''Factive Presupposition:''' “I do not regret having bought those over – priced tickets” (3); the sentence presupposes that Tom bought over-priced tickets.

'''Entailment:''' “I was not really getting into the flow of those reggae beats” (2); the remark entails that Tom was not able to fully feel the rhythm and the atmosphere of the reggae music played at the concert; therefore, he was not able to “identify” with the music

'''Implicature''': remark 4; Tom violates the Maxim of Manner; he is not brief and does not avoid unnecessary prolixity

<hr />
Back to the [[NMTS_Course_Overview|course overview]] 
Back to [[NMTS_Meeting_7|meeting 7]]

NMTS-Group9

2012-11-05T08:49:45Z

Elisabeth.krall: /* Our wiki pages */

{{MaterialUnderConstruction}}

= Wikipage of Group 9 =

== Overview ==

=== Members ===
[[User:Lisa| Lisa]] [[User:Marthe| Marthe]] [[User:Helena| Helena]] [[User:Elisabeth.krall| Elisabeth]] [[User:IsaB|Isabelle]]

=== Short description of the topic ===

'''Predicate logic - logical connectives'''

The purpose of Predicate logic is to avoid ambiguity in sentences by forming formulae out of natural language. Logical connectives are used to create formulae out of sentences with "and", "or", "if/then" and "not". The aim is to state if the given sentence is true or false in a given model.

==== Examples ====
===== and =====
Symbol: Ʌ 
Sentence: Harry is a student and Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) Ʌ teacher (snape)]] = true/false

===== or =====
Symbol: V 
Sentence: Harry is a student or Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) V teacher (snape)]] = true/false

===== if/then =====
Symbol: --> 
Sentence: If Harry is a student then Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) --> teacher (snape)]] = true/false

===== not =====
Symbol: ¬ 
Sentence: Harry is not a student. 
Formulae: <nowiki>[[</nowiki>¬student (harry)]] = true/false

==== Difficulties ====
* Abstraction of content/natural language
* Understanding the whole process from creating a model to interpret formulae
* Understanding the truth conditions of a formulae with connectives

== References and links ==

=== References ===

* Course material "Introduction to Semantics" by Manfred Sailer

=== Links ===

* [http://www.philosophy.hku.hk/think/sl Sentential Logic]

* [http://www.philosophy.hku.hk/think/pl Predicate Logic]

= Our e-learning objects =

== Our wiki pages ==


* in the Glossary:
** [[Glossary:Hyponym]]: the entry for ''hyponym''
** [[Glossary:_Predicate]]: the entry for ''predicate''
** [[Glossary:_Formulae]]: the entry for ''formulae''

== Our podcasts ==


== Our materials for an interactive whiteboard ==


== Our pictures ==

<gallery>
File:Lisa.jpg|Lisa
File:MartheBerkenheide.jpg|Marthe
File:Picture liss.jpg|Elisabeth
File:IsabelleBrend'amour.jpg|Isabelle
File:Helena.jpg|

</gallery>

== Our exercises ==

NMTS-Group9

2012-11-05T08:49:28Z

Elisabeth.krall: /* Our wiki pages */

{{MaterialUnderConstruction}}

= Wikipage of Group 9 =

== Overview ==

=== Members ===
[[User:Lisa| Lisa]] [[User:Marthe| Marthe]] [[User:Helena| Helena]] [[User:Elisabeth.krall| Elisabeth]] [[User:IsaB|Isabelle]]

=== Short description of the topic ===

'''Predicate logic - logical connectives'''

The purpose of Predicate logic is to avoid ambiguity in sentences by forming formulae out of natural language. Logical connectives are used to create formulae out of sentences with "and", "or", "if/then" and "not". The aim is to state if the given sentence is true or false in a given model.

==== Examples ====
===== and =====
Symbol: Ʌ 
Sentence: Harry is a student and Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) Ʌ teacher (snape)]] = true/false

===== or =====
Symbol: V 
Sentence: Harry is a student or Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) V teacher (snape)]] = true/false

===== if/then =====
Symbol: --> 
Sentence: If Harry is a student then Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) --> teacher (snape)]] = true/false

===== not =====
Symbol: ¬ 
Sentence: Harry is not a student. 
Formulae: <nowiki>[[</nowiki>¬student (harry)]] = true/false

==== Difficulties ====
* Abstraction of content/natural language
* Understanding the whole process from creating a model to interpret formulae
* Understanding the truth conditions of a formulae with connectives

== References and links ==

=== References ===

* Course material "Introduction to Semantics" by Manfred Sailer

=== Links ===

* [http://www.philosophy.hku.hk/think/sl Sentential Logic]

* [http://www.philosophy.hku.hk/think/pl Predicate Logic]

= Our e-learning objects =

== Our wiki pages ==


* in the Glossary:
** [[Glossary:Hyponym]]: the entry for ''hyponym''
** [[Glossary:Predicate]]: the entry for ''predicate''
** [[Glossary:_Formulae]]: the entry for ''formulae''

== Our podcasts ==


== Our materials for an interactive whiteboard ==


== Our pictures ==

<gallery>
File:Lisa.jpg|Lisa
File:MartheBerkenheide.jpg|Marthe
File:Picture liss.jpg|Elisabeth
File:IsabelleBrend'amour.jpg|Isabelle
File:Helena.jpg|

</gallery>

== Our exercises ==

NMTS-Group9

2012-11-05T08:47:57Z

Elisabeth.krall: /* Our wiki pages */

{{MaterialUnderConstruction}}

= Wikipage of Group 9 =

== Overview ==

=== Members ===
[[User:Lisa| Lisa]] [[User:Marthe| Marthe]] [[User:Helena| Helena]] [[User:Elisabeth.krall| Elisabeth]] [[User:IsaB|Isabelle]]

=== Short description of the topic ===

'''Predicate logic - logical connectives'''

The purpose of Predicate logic is to avoid ambiguity in sentences by forming formulae out of natural language. Logical connectives are used to create formulae out of sentences with "and", "or", "if/then" and "not". The aim is to state if the given sentence is true or false in a given model.

==== Examples ====
===== and =====
Symbol: Ʌ 
Sentence: Harry is a student and Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) Ʌ teacher (snape)]] = true/false

===== or =====
Symbol: V 
Sentence: Harry is a student or Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) V teacher (snape)]] = true/false

===== if/then =====
Symbol: --> 
Sentence: If Harry is a student then Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) --> teacher (snape)]] = true/false

===== not =====
Symbol: ¬ 
Sentence: Harry is not a student. 
Formulae: <nowiki>[[</nowiki>¬student (harry)]] = true/false

==== Difficulties ====
* Abstraction of content/natural language
* Understanding the whole process from creating a model to interpret formulae
* Understanding the truth conditions of a formulae with connectives

== References and links ==

=== References ===

* Course material "Introduction to Semantics" by Manfred Sailer

=== Links ===

* [http://www.philosophy.hku.hk/think/sl Sentential Logic]

* [http://www.philosophy.hku.hk/think/pl Predicate Logic]

= Our e-learning objects =

== Our wiki pages ==


* in the Glossary:
** [[Glossary:Hyponym]]: the entry for ''hyponym''
** [[Glossary:Predicate]]: the entry for ''predicate''

** [[Glossary:Formulae]]: the entry for ''formulae''

== Our podcasts ==


== Our materials for an interactive whiteboard ==


== Our pictures ==

<gallery>
File:Lisa.jpg|Lisa
File:MartheBerkenheide.jpg|Marthe
File:Picture liss.jpg|Elisabeth
File:IsabelleBrend'amour.jpg|Isabelle
File:Helena.jpg|

</gallery>

== Our exercises ==

NMTS-Group9

2012-11-05T08:47:15Z

Elisabeth.krall: /* Our wiki pages */

{{MaterialUnderConstruction}}

= Wikipage of Group 9 =

== Overview ==

=== Members ===
[[User:Lisa| Lisa]] [[User:Marthe| Marthe]] [[User:Helena| Helena]] [[User:Elisabeth.krall| Elisabeth]] [[User:IsaB|Isabelle]]

=== Short description of the topic ===

'''Predicate logic - logical connectives'''

The purpose of Predicate logic is to avoid ambiguity in sentences by forming formulae out of natural language. Logical connectives are used to create formulae out of sentences with "and", "or", "if/then" and "not". The aim is to state if the given sentence is true or false in a given model.

==== Examples ====
===== and =====
Symbol: Ʌ 
Sentence: Harry is a student and Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) Ʌ teacher (snape)]] = true/false

===== or =====
Symbol: V 
Sentence: Harry is a student or Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) V teacher (snape)]] = true/false

===== if/then =====
Symbol: --> 
Sentence: If Harry is a student then Snape is a teacher. 
Formulae: <nowiki>[[</nowiki>student (harry) --> teacher (snape)]] = true/false

===== not =====
Symbol: ¬ 
Sentence: Harry is not a student. 
Formulae: <nowiki>[[</nowiki>¬student (harry)]] = true/false

==== Difficulties ====
* Abstraction of content/natural language
* Understanding the whole process from creating a model to interpret formulae
* Understanding the truth conditions of a formulae with connectives

== References and links ==

=== References ===

* Course material "Introduction to Semantics" by Manfred Sailer

=== Links ===

* [http://www.philosophy.hku.hk/think/sl Sentential Logic]

* [http://www.philosophy.hku.hk/think/pl Predicate Logic]

= Our e-learning objects =

== Our wiki pages ==


* in the Glossary:
** [[Glossary:Hyponym]]: the entry for ''hyponym''
** [[Glossary:Predicate]]: the entry for ''predicate''
** [[http://www.lexical-resource-semantics.de/wiki/index.php/Glossary:_Formulae|Formulae]]

** [[Glossary:Formulae]]: the entry for ''formulae''

== Our podcasts ==


== Our materials for an interactive whiteboard ==


== Our pictures ==

<gallery>
File:Lisa.jpg|Lisa
File:MartheBerkenheide.jpg|Marthe
File:Picture liss.jpg|Elisabeth
File:IsabelleBrend'amour.jpg|Isabelle
File:Helena.jpg|

</gallery>

== Our exercises ==

Glossary: Formulae

2012-11-05T08:44:50Z

Elisabeth.krall: /* References */

{{MaterialUnderConstruction}}

= formulae =

== Definition ==

Formulae are expressions of logic that can be interpreted as false or true by applying the interpretation function ''I''.

== Examples ==

''professor(Mr. Sailer)=true'' 
''student(Mr.Sailer)=wrong''

== References ==

* Predicate Logic
* Logical Connectives
* Quantifiers

== Literature ==

* Chapter 2 of Manfred Sailer's textbook

Glossary: Formulae

2012-10-23T13:44:42Z

Elisabeth.krall:

= formulae =

== Definition ==

Formulae are expressions of logic that can be interpreted as false or true by applying the interpretation function ''I''.

== Examples ==

''professor(Mr. Sailer)=true'' 
''student(Mr.Sailer)=wrong''

== References ==

* Predicate Logic
* Logical Connectives

== Literature ==

* Chapter 2 of Manfred Sailer's textbook

Glossary: Formulae

2012-10-23T13:44:14Z

Elisabeth.krall: Created page with "= formulae = == Definition == Formulae are expressions of logic that can be interpreted as false or true by applying the interpretation function ''I''. == Examples == ''p..."

= formulae =

== Definition ==

Formulae are expressions of logic that can be interpreted as false or true by applying the interpretation function ''I''.

== Examples ==

''professor(Mr. Sailer)=true''
''student(Mr.Sailer)=wrong''

== References ==

* Predicate Logic
* Logical Connectives

== Literature ==

* Chapter 2 of Manfred Sailer's textbook

Basic Glossary

2012-10-23T13:35:25Z

Elisabeth.krall: /* F */

{{MaterialUnderConstruction}}

(Back to the meeting of [[NMTS_Meeting_2|October 23, 2012]])

= Glossary of Basic Semantic Terms =

== A ==

* [[Glossary:Ambiguity|'''ambiguity''']] ([[User:KimA]])

* [[Glossary:Antonym|'''antonym''']] ([[User:Leo]])

== B ==

== C ==

* [[Glossary:contradiction|'''contradiction''']] ([[User:Katarzyna]])
* [[Glossary:Complementarity|'''Complementarity''']] ([[User:VerenaS]])

== D ==

== E ==

== F ==

* [[Glossary: Formulae|'''formulae''']] ([[User:Elisabeth.krall]])

== G ==

== H ==

* [[Glossary:Homophony|'''homophony''']] ([[User:Anna]])

* [[Glossary:Hyponym|'''hyponym''']] ([[User:Lisa]])

== I ==

== J ==

== K ==

== L ==

* [[Glossary:Lexical Ambiguity|'''lexical ambiguity''']] ([[User:KimA]])

== M ==

* [[Glossary:Meronymy|'''meronymy''']] ([[User:Anna P.]])

== N ==

== O ==

== P ==

= Quantifiers =

Pronunciation

== Definition ==

Quantifiers refer to quantity
''Comment:''
...

== Examples ==

''more than half'' 
''a third''

== Related terms ==

* [[Glossary:Antonym|antonym]]
* [[Glossary:Homonym|homonym]]
* [[Glossary:Paraphrase|paraphrase]]

== References and links ==

== R ==

== S ==

* [[Glossary:Synonym|'''quantifiers''']] ([[User:BorisL]])

== T ==

== U ==

== V ==

== W ==

== X ==

== Y ==

== Z ==