VE492- Homework 9 Solved

1           Propositional Logic 1
We ask a logician (who only tells the truth) about his sentimental life, and he answers the following two statements:

I love Ann or I love Beth.
If I love Ann, then I love Beth.
What can we conclude? Answer the following questions by ”yes”, ”no”, ”unsure”.

Does he love Ann?
Does he love Beth?
Does he love both?
2           Propositional Logic 2
Which of the following are correct?

False |= True.
True |= False.
(A ∧ B) |= (A ⇔ B).
A ⇔ B |= A ∨ B.
A ⇔ B |= ¬A ∨ B.
(A ∧ B) ⇒ C |= (A ⇒ C) ∨ (B ⇒ C).
(C ∨ (¬A ∧ ¬B)) ≡ ((A ⇒ C) ∧ (B ⇒ C).
(A ∨ B) ∧ (¬C ∨ ¬D ∨ E) |= (A ∨ B).
(A ∨ B) ∧ (¬C ∨ ¬D ∨ E) |= (A ∨ B) ∧ (¬D ∨ E).
(A ∨ B) ∧ ¬(A ⇒ B) is satisfiable.
(A ⇔ B) ∧ (¬A ∨ B) is satisfiable.
(A ⇔ B) ⇔ C has the same number of models as A ⇔ B for any fixed set of proposition symbols
that includes A,B,C.

1

a,b,c,d

3           Propositional Logic 3
We denote L0 the set of propositional logic sentences built from a set X of n propositional symbols. we consider the following new formal languages, where some logical connectives are not allowed: • L1 is defined as follows:

True and False are sentences of L1. All symbols of X are sentences of L1. If s,s0 are two sentences of L1, then ¬s, (s ∧ s0), (s ∨ s0), and (s ⇒ s0) are four sentences of L1. • L2 is defined as follows:

True and False are sentences of L2. All symbols of X are sentences of L2. If s,s0 are two sentences of L2, then ¬s, (s ∧ s0), and (s ∨ s0) are three sentences of L2. • L3 is defined as follows:

True and False are sentences of L3. All symbols of X are sentences of L3. If s,s0 are two sentences of L3, then ¬s and (s ∧ s0) are two sentences of L3. • L4 is defined as follows:

True and False are sentences of L4. All symbols of X are sentences of L4. If s are two sentences of L4, then ¬s is a sentence of L4.

We consider the following binary relation between languages: L ⊆ L’ iff any sentences that can be expressed in L can equivalently be expressed in L’.

Answer ”yes” or ”no” the following questions.

L1 ⊆ L0
L2 ⊆ L0
L3 ⊆ L0
L4 ⊆ L0
L0 ⊆ L1
L0 ⊆ L2
L0 ⊆ L3
L0 ⊆ L4
4           First-Order Logic 1
Are the following are valid (necessarily true) sentences?

(∃x x = x) ⇒ (∀y∃z y = z).
∀x P(x) ∨ ¬P(x).
∀x Smart(x) ∨ (x = x).
Answer ”Valid” or ”Invalid” the following questions.

Valid,Valid,Valid

5           First-Order Logic 2
This exercise uses the function Map Color and predicates In(T,y), Borders(x,y), and Country(x), whose arguments are geographical regions, along with constant symbols for various regions. In each of the following we give an English sentence and a number of candidate logical expressions.

Paris and Marseilles are both in France.In(Paris ∧ Marseilles,France).
In(Paris,France) ∧ In(Marseilles,France). (iii) In(Paris,France) ∨ In(Marseilles,France).
There is a country that borders both Iraq and Pakistan.∃c Country(c) ∧ Border(c,Iraq) ∧ Border(c,Pakistan).
∃c Country(c) ⇒ [Border(c,Iraq) ∧ Border(c,Pakistan)].
[∃c Country(c)] ⇒ [Border(c,Iraq) ∧ Border(c,Pakistan)].
∃c Border(Country(c),Iraq ∧ Pakistan).
All countries that border Ecuador are in South America.∀c Country(c) ∧ Border(c,Ecuador) ⇒ In(c,SouthAmerica).
∀c Country(c) ⇒ [Border(c,Ecuador) ⇒ In(c,SouthAmerica)]. (iii) ∀c [Country(c) ⇒ Border(c,Ecuador)] ⇒ In(c,SouthAmerica).
(iv) ∀c Country(c) ∧ Border(c,Ecuador) ∧ In(c,SouthAmerica).

No region in South America borders any region in Europe.¬[∃c,d In(c,SouthAmerica) ∧ In(d,Europe) ∧ Borders(c,d)].
∀c,d [In(c,SouthAmerica) ∧ In(d,Europe)] ⇒ ¬Borders(c,d)].
¬∀c In(c,SouthAmerica) ⇒ ∃d In(d,Europe) ∧ ¬Borders(c,d).
∀c In(c,SouthAmerica) ⇒ ∀d In(d,Europe) ⇒ ¬Borders(c,d).
No two adjacent countries have the same map color.∀x,y ¬Country(x) ∨ ¬Country(y) ∨ ¬Borders(x,y) ∨ ¬(MapColor(x) = MapColor(y)).
∀x,y (Country(x)∧Country(y)∧Borders(x,y)∧¬(x = y)) ⇒ ¬(MapColor(x) = MapColor(y)).
∀x,y Country(x) ∧ Country(y) ∧ Borders(x,y) ∧ ¬(MapColor(x) = MapColor(y)).
∀x,y (Country(x) ∧ Country(y) ∧ Borders(x,y)) ⇒ MapColor(x 6= y).
For each of the logical expressions, state whether it...

correctly expresses the English sentence;
is syntactically invalid and therefore meaningless;
is syntactically valid but does not express the meaning of the English sentence.
233

2333

1222

1333