boolean connectives - people

22
Outline Motivation Negation Conjunction Disjunction Sentences Ambiguity The Game in Tarski’s World Boolean Connectives Torben Amtoft Kansas State University Torben Amtoft Kansas State University Boolean Connectives

Upload: others

Post on 23-Nov-2021

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Boolean Connectives

Torben AmtoftKansas State University

Torben Amtoft Kansas State University Boolean Connectives

Page 2: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Motivation

Negation

Conjunction

Disjunction

Sentences

Ambiguity

The Game in Tarski’s World

Torben Amtoft Kansas State University Boolean Connectives

Page 3: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Agenda

I Chapter 1 introduced basic FOL(one main aim of book)

I Chapter 2 introduced notion of logical consequence(other main aim of book)

I Chapter 3 introduces more features of FOL

Torben Amtoft Kansas State University Boolean Connectives

Page 4: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Boolean Connectives

Recall that an atomic sentence is a predicate applied to one ormore terms:

Older(father(max),max)

We now extend FOL with the boolean connectives:

I and, to be written ∧I or, to be written ∨I not, to be written ¬.

Torben Amtoft Kansas State University Boolean Connectives

Page 5: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Negation (“not”)

Truth table:P ¬P

true falsefalse true

I Symbol ¬ is not standard (cf. p. 91);in emails and on the web I’ll write ˜.

I ¬¬P is equivalent to Punlike English, where double negation emphasizes:it doesn’t make no difference; there will be no nothing

I ¬LeftOf(a, b) is not equivalent to RightOf(a, b)

Torben Amtoft Kansas State University Boolean Connectives

Page 6: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Conjunction (“and”)P Q P ∧ Q

true true truetrue false falsefalse true falsefalse false false

I in emails and on the web I may write /\ or ˆI English sentences translated using ∧ may

I not use “and”

Max is a tall man Tall(max) ∧ Man(max)I carry temporal implications

Max went home and went to sleepI be expressed using other connectives

Max was home but Claire was not

Torben Amtoft Kansas State University Boolean Connectives

Page 7: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Disjunction (“or”)P Q P ∨ Q

true true truetrue false truefalse true truefalse false false

I in emails and on the web I may write \/ or v.

I the interpretation is “inclusive”, not “exclusive”:true ∨ true = true.

I In English, the default is often “exclusive”, as when a waiteroffers soup or salad

I We can express exclusive or (p. 75):

(P ∨ Q) ∧ ¬(P ∧ Q)

I We can also encode “neither nor”: ¬(P ∨ Q)

Torben Amtoft Kansas State University Boolean Connectives

Page 8: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Disjunction (“or”)P Q P ∨ Q

true true truetrue false truefalse true truefalse false false

I in emails and on the web I may write \/ or v.

I the interpretation is “inclusive”, not “exclusive”:true ∨ true = true.

I In English, the default is often “exclusive”, as when a waiteroffers soup or salad

I We can express exclusive or (p. 75): (P ∨ Q) ∧ ¬(P ∧ Q)

I We can also encode “neither nor”: ¬(P ∨ Q)

Torben Amtoft Kansas State University Boolean Connectives

Page 9: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

SentencesA sentence P is thus given by

I if P is an atomic sentence then P is also a sentence;

I if P1 and P2 are sentences then P1 ∧ P2 is a sentence;

I if P1 and P2 are sentences then P1 ∨ P2 is a sentence;

I if P is a sentence then ¬P is a sentence.

This can be written in “Backus-Naur” notation:

P ::= atomic sentence

| P ∧ P

| P ∨ P

| ¬P

Torben Amtoft Kansas State University Boolean Connectives

Page 10: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Resolving Ambiquity

Algebra

expression how to read it how not to read it

3 + 4× 5 3 + (4× 5) = 23 (3 + 4)× 5 = 35

3× 4 + 5 (3× 4) + 5 3× (4 + 5)

Boolean Algebra interpretation I interpretation II

true ∨ false ∧ false true ∨ (false ∧ false) (true ∨ false) ∧ falseevaluates to true evaluates to false

I In the literature, I is often chosen (as ∧ is considered“multiplication” and ∨ is considered “addition”).

I In the textbook, neither I or II is chosen, instead (p. 80):

Parentheses must be used whenever ambiguity wouldresult from their omission

Negation binds tightly: ¬P ∧ Q is not equivalent to ¬(P ∧ Q).

Torben Amtoft Kansas State University Boolean Connectives

Page 11: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Resolving Ambiquity

Algebra

expression how to read it how not to read it

3 + 4× 5 3 + (4× 5) = 23 (3 + 4)× 5 = 35

3× 4 + 5 (3× 4) + 5 3× (4 + 5)

Boolean Algebra interpretation I interpretation II

true ∨ false ∧ false true ∨ (false ∧ false) (true ∨ false) ∧ falseevaluates to true evaluates to false

I In the literature, I is often chosen (as ∧ is considered“multiplication” and ∨ is considered “addition”).

I In the textbook, neither I or II is chosen, instead (p. 80):

Parentheses must be used whenever ambiguity wouldresult from their omission

Negation binds tightly: ¬P ∧ Q is not equivalent to ¬(P ∧ Q).

Torben Amtoft Kansas State University Boolean Connectives

Page 12: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Resolving Ambiquity

Algebra

expression how to read it how not to read it

3 + 4× 5 3 + (4× 5) = 23 (3 + 4)× 5 = 35

3× 4 + 5 (3× 4) + 5 3× (4 + 5)

Boolean Algebra interpretation I interpretation II

true ∨ false ∧ false true ∨ (false ∧ false) (true ∨ false) ∧ falseevaluates to true evaluates to false

I In the literature, I is often chosen (as ∧ is considered“multiplication” and ∨ is considered “addition”).

I In the textbook, neither I or II is chosen, instead (p. 80):

Parentheses must be used whenever ambiguity wouldresult from their omission

Negation binds tightly: ¬P ∧ Q is not equivalent to ¬(P ∧ Q).

Torben Amtoft Kansas State University Boolean Connectives

Page 13: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Resolving Ambiquity

Algebra

expression how to read it how not to read it

3 + 4× 5 3 + (4× 5) = 23 (3 + 4)× 5 = 35

3× 4 + 5 (3× 4) + 5 3× (4 + 5)

Boolean Algebra interpretation I interpretation II

true ∨ false ∧ false true ∨ (false ∧ false) (true ∨ false) ∧ falseevaluates to true evaluates to false

I In the literature, I is often chosen (as ∧ is considered“multiplication” and ∨ is considered “addition”).

I In the textbook, neither I or II is chosen, instead (p. 80):

Parentheses must be used whenever ambiguity wouldresult from their omission

Negation binds tightly: ¬P ∧ Q is not equivalent to ¬(P ∧ Q).

Torben Amtoft Kansas State University Boolean Connectives

Page 14: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Resolving Ambiquity

Algebra

expression how to read it how not to read it

3 + 4× 5 3 + (4× 5) = 23 (3 + 4)× 5 = 35

3× 4 + 5 (3× 4) + 5 3× (4 + 5)

Boolean Algebra interpretation I interpretation II

true ∨ false ∧ false true ∨ (false ∧ false) (true ∨ false) ∧ falseevaluates to true evaluates to false

I In the literature, I is often chosen (as ∧ is considered“multiplication” and ∨ is considered “addition”).

I In the textbook, neither I or II is chosen, instead (p. 80):

Parentheses must be used whenever ambiguity wouldresult from their omission

Negation binds tightly: ¬P ∧ Q is not equivalent to ¬(P ∧ Q).Torben Amtoft Kansas State University Boolean Connectives

Page 15: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Ambiguity in English

Consider the phrase

you can have soup or salad and pasta.

If the intended meaning is “soup or (salad and pasta)”:

you can have soup or both salad and pasta

If the intended meaning is “(soup or salad) and pasta”:

you can have soup or salad, and pasta

or

you can have pasta and either soup or salad

Torben Amtoft Kansas State University Boolean Connectives

Page 16: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Ambiguity in English

Consider the phrase

you can have soup or salad and pasta.

If the intended meaning is “soup or (salad and pasta)”:

you can have soup or both salad and pasta

If the intended meaning is “(soup or salad) and pasta”:

you can have soup or salad, and pasta

or

you can have pasta and either soup or salad

Torben Amtoft Kansas State University Boolean Connectives

Page 17: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Ambiguity in English

Consider the phrase

you can have soup or salad and pasta.

If the intended meaning is “soup or (salad and pasta)”:

you can have soup or both salad and pasta

If the intended meaning is “(soup or salad) and pasta”:

you can have soup or salad, and pasta

or

you can have pasta and either soup or salad

Torben Amtoft Kansas State University Boolean Connectives

Page 18: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

Ambiguity in English

Consider the phrase

you can have soup or salad and pasta.

If the intended meaning is “soup or (salad and pasta)”:

you can have soup or both salad and pasta

If the intended meaning is “(soup or salad) and pasta”:

you can have soup or salad, and pasta

or

you can have pasta and either soup or salad

Torben Amtoft Kansas State University Boolean Connectives

Page 19: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

The Game in Tarski’s World

I Given sentence P = Cube(c) ∨ Cube(d).

I Given world where c is a cube but d is not.

We Opponent

P is false in this worldSo c is not a cube?

Eh. . . I admit defeat

OK, P is true in this worldBecause c is a cube or because d is?

Because d is a cubeYou lost but could have won

OK, because c is a cubeYou won (finally!)

Torben Amtoft Kansas State University Boolean Connectives

Page 20: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

The Game in Tarski’s World

I Given sentence P = Cube(c) ∨ Cube(d).

I Given world where c is a cube but d is not.

We Opponent

P is false in this worldSo c is not a cube?

Eh. . . I admit defeatOK, P is true in this world

Because c is a cube or because d is?Because d is a cube

You lost but could have won

OK, because c is a cubeYou won (finally!)

Torben Amtoft Kansas State University Boolean Connectives

Page 21: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

The Game in Tarski’s World

I Given sentence P = Cube(c) ∨ Cube(d).

I Given world where c is a cube but d is not.

We Opponent

P is false in this worldSo c is not a cube?

Eh. . . I admit defeatOK, P is true in this world

Because c is a cube or because d is?Because d is a cube

You lost but could have wonOK, because c is a cube

You won (finally!)

Torben Amtoft Kansas State University Boolean Connectives

Page 22: Boolean Connectives - People

OutlineMotivation

NegationConjunctionDisjunctionSentencesAmbiguity

The Game in Tarski’s World

More about the Game

I Given sentence P = Cube(a) ∨ ¬Cube(a).

We Opponent

P is true in this worldBecause a is a cube orbecause a is not a cube?

Eh. . . I don’t knowbut P will always be true!

Please answer my question!

I Who won the game???

Torben Amtoft Kansas State University Boolean Connectives