Subiectul 1

1. Either Bulgaria is Romania’s neighbor, or it’s not. (logica propozitiilor)

V = Bulgaria este vecinul Romaniei.

V v ~V

2. I will pass the exam only if I will study hard. (propositional logic)

P = I will pass the exam

S = I will study hard

P→S

I will pass the exam unless I will be lazy.

P = I will pass the exam

L = I will be lazy

~L → P

3. All rich countries are strong.

R_ = rich

C_=country

S_=strong

(ꓯ x)((Rx & Cx)→Sx)

All countries are strong only if they are rich.

(ꓯ x)((Cx → Sx)→Rx)

All humans are mortal.

(ꓯ x)(Hx→Mx)

A only if B = A→B

4. There is no fish which can fly.

F_ = fish

L_= can fly

~(ꓱ x)(Fx & Lx)

II

Check if the following sequences are valid:

1. A→(B↔C), B v ~C Ⱶ A & (C v B)

0 1 0 10 0 11 0 0 00 0

Invalid

If the argument is invalid, then all premises are true and the conclusion false.

Presuppose that all premises are true and the conclusion false.

The first premise is true because it is a conditional with a false antecedent. I made A false.

The second premise is true because it is a disjunction with at least a true disjunct. Disjunct ~C is true
because C is false.

The conclusion is false because it is a conjunction with at least a false conjunct, A.

2. A→B, ~B→~C Ⱶ A v (B v C)

010 1 11 00 000

Invalid

3. (ꓱ x)(Fx ↔~Gx) ⊭ (ꓱ x)(Fx v ~Gx) D = {α, }

1 0

Fa ↔ ~Ga Fa v ~Ga

0 1 0 0 00

If all the premises are true and the conclusion false, the argument is invalid.

We build a model M with a domain D = {α}.

Ext(F) = Ø

Ext(G) = {α}

Ref(a) in D is α.

The premise is true because its main operator is the existential quantifier, which is true if at least one
instance is true. The instance “Fa ↔ ~Ga” is true because it is a biconditional where both members are
false. Fa is false because α ∉ Ext(F). ~Ga is false because Ga is true. Ga is true because α ∈ Ext(G).
The conclusion is false because its main operator is an existential quantifier, which is false if all its
instances are false. The instance Fa v ~Ga is false because it is a disjunction with both disjuncts
false. Fa and ~Ga are both false, as explained above.

4. (ꓯ x)Fx → (ꓱ x)Gx ⊭ (ꓯ x)(~Fx v Gx) D = {α, β }

1 0

Fa Ga ~Fa v Ga

1 0 0 0 0

Fb Gb ~Fb v Gb

0 0

Ext(F) = {α}

Ext(G) = Ø

(ꓱ x)(Fx → Gx) ⊭ (ꓯ x)(~Fx v Gx) D = {α, β}

1 0

Fa→Ga ~Fa v Ga

1 0 0 0 0 0

Fb → Gb ~Fb v Gb

1 1 1 0 11

Ext(F) = {α, β}

Ext(G) = {β}

III

1. A→B, ~C→~B, ~C ⱵNK ~A

1(1)A→B premise

2(2)~C→~B premise

3(3)~C premise

4(4)A assumption

1,4(5)B 1,4 E→

2,3(6)~B 2, 3 E→
1,2,3,4(7)λ 5, 6 E~

1,2,3(8)~A 4, 7 I~

2. ~A v ~B ⱵNK ~(A & B)

1(1)~A v ~B premise

2(2)A & B assumption

2(3)A 2, E&

2(4)B 2, E&

5(5)~A assumption

2,5(6)λ 3, 5 E~

5(7)~(A & B) 2, 6 I~

8(8)~B assumption

2, 8(9)λ 4, 8 E~

8(10)~(A & B) 2, 9 I~

1(11)~(A & B) 1, 5, 7, 8, 10 Ev

3 (ꓱ x)(Fx & ~Gx) ⱵNK ~(ꓯ x)(~Gx → ~Fx)

1(1)(ꓱ x)(Fx & ~Gx) premise

2(2)(ꓯ x)(~Gx→~Fx) assumption for I~

2(3)~Ga → ~Fa 2, E ꓯ

4(4)Fa & ~Ga assumption for E ꓱ

4(5)~Ga 4, E&

4(6)Fa 4, E&

2,4(7)~Fa 3, 5 E→

2,4(8)λ 6, 7 E~

4(9)~(ꓯ x)(~Gx→~Fx) 2, 8 I~

1(10)~(ꓯ x)(~Gx→~Fx) 1, 4, 9 E ꓱ
4. (ꓯ x)(Fx→(ꓯ y)~Fy) ⱵNK (ꓯ x)~Fx

1(1)(ꓯ x)(Fx→(ꓯ y)~Fy) premise

2(2)Fa assumption

1(3)Fa→(ꓯ y)~Fy 1, E ꓯ

1,2(4)(ꓯ y)~Fy 3, 2 E→

1,2(5)~Fa 4, E ꓯ

1,2(6)λ 2, 5 E~

1(7)~Fa 2, 6 I~

1(8)(ꓯ x)~Fx 7, I ꓯ