0% found this document useful (0 votes)
34 views7 pages

Logic MIDTERM Prep Sheet

Uploaded by

Irina Egic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views7 pages

Logic MIDTERM Prep Sheet

Uploaded by

Irina Egic
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

MIDTERM PREP SHEET.

1.​ An argument is valid if and only if it is impossible for the premises to be true and the
conclusion be false.
2.​ Some sentences A, B tautologically entail C iff there is no valuation that makes A, B true
and C false.
3.​ Some sentences A, B are tautologically equivalent iff they have the same truth value on
every valuation.

1.​ It DEFINITELY HOLDS that A, B tautologically entail C. (because there is no valuation


where C is false)
2.​ It is a CONTRADICTION because ㄱA and B always have different TV.
3.​ It is NOT A CONTRADICTION since there is at least one valuation that makes them all
true together.
1.​ (ㄱA ㄱC) or ㄱ(A V C)
2.​ (B → D)
3.​ B → ㄱC
4.​ (A V D) ㄱ(A D)
5.​ B ↔ (A ↔V C)
6.​ ㄱD → ㄱB
1.​
((F ↔ C G) V (H V ㄱ F)

T F F T T T T F T

T T T F T T T F T

F T F T T T T T F

F F T F T T T T F

T F F T F F F F T

T T T F T F F F T

F T F T T F T T F

F F T F T F T T F

This is NEITHER a CONTRADICTION (it is not false on every valuation) nor a TAUTOLOGY (it
is not true on every valuation)

2.​ NOT TAUTOLOGICALLY EQUIVALENT. (at least one valuation with different truth
value).

(ㄱ F V G) → H

T F T F F F

1.​ They are JOINTLY TAUTOLOGICALLY CONSISTENT, since at least one valuation
makes them all true together.
(O → ㄱ R) ㄱ (R O)

T F F T F T T T

T T T F T F F T

F T F T T T F F

F T T F T F F F

2.​ They are JOINTLY TAUTOLOGICALLY CONSISTENT, since at least one valuation
makes them all true together.

(T ↔ ㄱ W) → M ㄱ ((M V W) V T)

T F F T T T F T T T T T

T F F T T F F F T T T T

T T T F T T F T T F T T

T T T F F F F F F F T T

F T F T T T F T T T T F

F T F T F F F F T T T F

F F T F T T F T T F T F

F F T F T F T F F F F F
1.​ B1: The butler is lying.
C1: The cook is lying.
B2: The butler is guilty.
C2: The cook is guilty.

ㄱ(B1 C2)
C1 → B2
B1 → C2
∴ ㄱ B1 ↔ B2

ㄱ (B1 C2) C1 → B2 B1 → C2 ∴ ㄱ B1 ↔ B2

T F F F F T F F T T F F F

INVALID ARGUMENT!

(premises true and conclusion false)

2.​ A: Mira is angry


H: Mira is hungry

A → ㄱH
H → ㄱA
∴ (A V H) ㄱ(A H)

A H A → ㄱH H → ㄱA ∴ (A V H) ㄱ(A H)

F F T T F
INVALID ARGUMENT!

(premises true and conclusion false)


1.​ Ǝx(Vx Sx Txh)
2.​ ƎxƎy(Txi Tyi Sx Sy ㄱx = y)
3.​ ∀x ((Sx Txh) → Txi)
4.​ ㄱƎxƎyƎz(Vx Vy Vz ㄱSx ㄱSy ㄱSz ㄱx = y ㄱx = z ㄱy = z)
5.​ Ǝx (Sx Txi Vy ((Sy Tyi) → y = x) ㄱx = i)
6.​ ∀x(ㄱTxx → Thx)
7.​ ƎxƎy (Vx ∀z (Vz → x = z) Sy ∀z (Sz → y = z) x = z)
1.​
Ǝx(Fx ㄱGx)

NOT A LOGICAL TRUTH NOT A CONTRADICTION

Domain: a Domain: a
F: empty F: a
G: empty G: empty

2.​
NOT LOGICALLY EQUIVALENT

∀x(Fx ↔ Gx) ∀x(Fx → Gx)

Domain: a
F: empty
G: a

3.​

4.​ INVALID
Domain: a
G: a
F: empty
H: a

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy