QUIZ 1.3.

1) In every Terry's World, if object a is to the left of object b and b is to the left of c, then "b is
between c and a" is guaranteed to be true. – FALSE

2) Is the sentence "2=2" true or false in the world of counting numbers (the Numbers World)? –
TRUE

3) In the world of counting numbers (the Numbers World), if one number is less than a second,
then the second must be greater than or bigger than the first. – TRUE

4) In every Terry's World, if an object is square then it can't be a circle. – TRUE

5) Is the sentence "3 is odd" true or false in the world of counting numbers (the Numbers
World)? – TRUE

6) In the world of counting numbers (the Numbers World), if a number is even then it can't be
odd. – TRUE

7) Is the sentence "2=(1*1)" true or false in the world of counting numbers (the Numbers
World)? – FALSE

8) In the world of counting numbers (the Numbers World), if a number is even then it must be
the sum of two even numbers. – FALSE

9) In every Terry's World, if one object is above a second, then the second must be below the
first. – TRUE

10) Is the sentence "2>(1+1)" true or false in the world of counting numbers (the Numbers
World)? – FALSE

11) Is the sentence "2=2" true or false in the world of counting numbers (the Numbers World)? –
TRUE

12) In every Terry's World, if "b is between c and a" is true, then b must be to the left of c. –
FALSE

13) In every Terry's World, if b is between c and a then b is between a and c. – TRUE

14) In the world of counting numbers (the Numbers World), there is a largest number. – FALSE

15) In the world of counting numbers (the Numbers World), if a number is even then it can't be
the sum of two odd numbers. – FALSE
QUIZ 1.3.2

N6 – not D, not C, not B, not A

N1 – not C
N3 – D
N4 – not D, not C, not A, not F
N5 – not D, not C, not B

ANSWERS: 1F, 2A, 3D, 4B, 5E, 6c/can’t be determined

Flowers and dad bought eric cheese

QUIZ 1.4

1) Suppose Set1 is a consistent set of sentences. Suppose some of the sentences in Set1 are
replaced by sentences which logically mean the same thing as the original or are logically
equivalent to the original.
So you know for sure that: The new set of sentences is a CONSISTENT set of sentences
2) Suppose Set1 is a set of sentences about a particular TARSKI blocks world. The world isn't
pictured. It could be any particular TARSKI blocks world. Suppose all the sentences in the set are
true in the TARSKI blocks world.
So you know for sure that: Set1 is logically CONSISTENT
3) Suppose Set2 is a set of sentences about a particular TARSKI blocks world. The world isn't
pictured. It could be any particular TARSKI blocks world. Suppose Set2 is logically consistent.
So you know for sure that: Neither (a) and (b)
4) Suppose Reasoning2 above is valid reasoning. Suppose its conclusion C2 is true.
This means you know for sure that: Neither (1) nor (2)

5) Suppose Reasoning2 above is valid reasoning. Suppose its conclusion C2 is false.

This means you know for sure that: at least some premises (the P's) are false also.
6) Suppose Reasoning2 above is invalid reasoning.
This means you know for sure that: Neither (1) nor (2)

7) Suppose Reasoning2 above is valid reasoning.

This means you know for sure that: if all the premises or givens (the P's) in the reasoning
are true then the conclusion (C2) is true also.

8) Suppose Reasoning2 above is invalid and that C1 is the opposite of sentence C2. That is, when
C1 is true, C2 is false and vice versa.
This means you know for sure that: Neither (1) nor (2)

9) Suppose Reasoning1 above is valid reasoning. Suppose its premises are all true.
This means you know for sure that: the conclusion (C1) is true also.

10) Suppose Reasoning2 has a conclusion which is always true (for example, it is A A).
This means you know for sure that: Reasoning2 is valid.

11) Suppose Set2 is a set of sentences about a particular TARSKI blocks world. The world isn't
pictured. It could be any particular TARSKI blocks world. Suppose Set2 is logically consistent.
So you know for sure that: Neither (a) and (b)
12) Suppose Set2 is a set of sentences about a particular TARSKI blocks world. The world isn't
pictured. It could be any particular TARSKI blocks world. Suppose Set2 is logically inconsistent.
So you know for sure that: Neither (a) and (b)

13) Suppose Set1 is a set of sentences about a particular TARSKI blocks world. The world isn't
pictured. It could be any particular TARSKI blocks world. Suppose Set1 is logically consistent.
So you know for sure that: Neither (a) and (b)

14) Suppose Set1 is a set of sentences about a particular TARSKI blocks world. The world isn't
pictured. It could be any particular TARSKI blocks world. Suppose Set1 is logically consistent.
So you know for sure that: all the sentences in the set can be true together in some
TARSKI blocks world (but maybe not this one)

15) Suppose Reasoning2 above is valid reasoning.

This means you know for sure that: Neither (1) nor (2)

16) Suppose Reasoning1 above is invalid reasoning.

This means you know for sure that: Neither (1) nor (2)
17) Suppose Reasoning1 above has all false premises and a true conclusion C1.
This means you know for sure that: Neither (1) nor (2)

18) Suppose Reasoning1 above is invalid reasoning. Suppose its premises are all false.
This means you know for sure that: Neither (1) nor (2)
19) Suppose Reasoning2 above is invalid reasoning. Suppose its premises are all true.
This means you know for sure that: Neither (1) nor (2)

20) Suppose Reasoning1 above is invalid reasoning. Suppose its premises are all false.
This means you know for sure that: Neither (1) nor (2)

21) Suppose Set1 is a set of sentences about a particular TARSKI blocks world. The world isn't
pictured. It could be any particular TARSKI blocks world. Suppose some of the sentences in the
set are true in the TARSKI blocks world and some are false.
So you know for sure that: Neither (1) nor (2)

22) Suppose Reasoning1 above has all false premises and a false conclusion C1.
This means you know for sure that: Neither (1) nor (2)
23) Suppose Reasoning2 is invalid. Suppose a premise is taken away from Reasoning2. This new
reasoning is called Reasoning2-.
Then you know for sure that: Reasoning2- is invalid.

24) Suppose Set2 is a set of sentences about a particular TARSKI blocks world. The world isn't
pictured. It could be any particular TARSKI blocks world. Suppose all the sentences in the set are
false in the TARSKI blocks world.
So you know for sure that: Neither (1) nor (2)

25) Suppose Set1 is not a consistent set of sentences. Suppose some of the sentences in Set1 are
replaced by sentences which logically mean the same thing as the original or are logically
equivalent to the original.
So you know for sure that: The new set of sentences is a consistent set of sentences
26) Suppose Reasoning2 above is valid and that C1 is the same sentence as C2.
This means you know for sure that: Reasoning1 is valid.

27) Suppose Reasoning2 above is valid and that C1 is not the same sentence as C2.
This means you know for sure that: Neither (1) nor (2)

28) Suppose Reasoning1 above has all true premises and a true conclusion C1.
This means you know for sure that: Neither (1) nor (2)
29) Suppose Reasoning2 above has all true premises and a false conclusion C2.
This means you know for sure that: Reasoning2 is invalid.

30) Suppose Set1 is a consistent set of sentences. The negations of each of the sentences in Set1
are in Set2. Suppose Set2 is as above.
So you know for sure that: Neither (a) nor (b)

31) Suppose Reasoning1 has two premises which cannot be true together (for example, one
premise says S and the other says ¬S).
This means you know for sure that: Neither (1) nor (2)

32) Suppose Reasoning2 is valid. Suppose a premise is taken away from Reasoning2. This new
reasoning is called Reasoning2-.
Then you know for sure that: Neither (1) nor (2)

33) Suppose Reasoning1 is invalid. Suppose another premise is added to Reasoning1. This new
reasoning is called Reasoning1+.
Then you know for sure that: Neither (1) nor (2)

-all sentences are true = logically consistent

-consistent, sentences replaced by logical equivalent ones = new sentences are consistent
-not consistent, sentences replaced by logical equivalent ones = new set not consistent
-false conclusion = at least some premises are false
-true premises, false conclusion c1 = invalid reasoning1
-valid, true premises = conclusion is true too
QUIZ 2.5

¬∀x Male(x) = TRUE

∃x ¬Male(x) = TRUE (there exists something not male)
∀x male(x) = FALSE
¬∃x Male(x) = FALSE

∀x ¬Dead(x) = FALSE
¬∀xDead(x) = TRUE

¬∀xFemale(x) = TRUE
¬∃x Female(x) = FALSE

∃x∃y ChildOf(x,y) = TRUE

∃x∃y¬ChildOf(x,y) = TRUE
∃x∀y ChildOf(x,y) = FALSE
∀x∀y ChildOf(x,y) = FALSE
∀x∀y ¬ChildOf(x,y) = FALSE

FatherOf(A,C)∨¬MotherOf(B,C) = TRUE
¬FatherOf(A,C)∨MotherOf(B,C) = TRUE
FatherOf(A,C)∨MotherOf(B,C) = TRUE

∃x∃y¬ParentOf(x,y) = TRUE
∃x∀y ParentOf(x,y) = FALSE
∀x∀y ParentOf(x,y) = FALSE
∀x∃y ParentOf(x,y) = FALSE

QUIZ 2.6

1) Is the formula " (Even(2) Odd(3)) (Even(2)∧ odd(3))" in the NUMBERS WORLD
language true or false in the NUMBERS world? – TRUE
2) Is the formula " 4 2 6 3" in the NUMBERS WORLD language true or false in the
NUMBERS world? – FALSE

3) Is the formula "2 4 3 6" in the NUMBERS WORLD language true orfalse in the NUMBERS
world? - TRUE

3) Is the formula "(odd(3) odd(2)) (even(3) even(2))" in the NUMBERS WORLD language true
or false in the NUMBERS world? – TRUE

4) Is the NUMBERS WORLD formula " x(Even(x) (x 2 x=2))" true or false in the NUMBERS
world? – TRUE

5) Is the NUMBERS WORLD language formula " x(Odd(x)∧(x 1 x=1))" true or false in the
NUMBERS world? – FALSE

6) NUMBER LINE Q: Is the following well-formed formula true or false?

(∀x)(positive(x)∧greaterthan(x,0)) – FALSE

7) NUMBER LINE Q: Is the following well-formed formula true or false?

(∃x)(positive(x)∧greaterthan(x,0)) – FALSE

8) Is the NUMBERS language formula "&not4>2 ∧ &not4<2" true or false in the NUMBERS
world? – FALSE

9) Is the NUMBERS WORLD language sentence odd(2) (odd(3) ∧ 3>2) true or false? –
FALSE

10) Is the NUMBERS formula "(Odd(3)∧(Even(2)∨Even(1)))

((Odd(3)∧Even(2))∨(Odd(3)∧Even(1)))" true orfalse in the NUMBERS world? – TRUE

11) Is the NUMBERS WORLD language formula " x(x 2∧Even(x))" true or false in the
NUMBERS world? – TRUE

12) Is the NUMBERS WORLD language formula " x(20 x (2+3)=x)" true or false in the
NUMBERS world? – FALSE

17) x(Odd(x)∧ 2 x) – TRUE

19) Is the NUMBERS WORLD language formula " x (x 2∧Even(x))" true or false in the
NUMBERS world? – FALSE

NUMBER LINE Q:
13) (∀y)(∃x)lessthan(x,y) – TRUE
13) (∃x)(∀y)lessthan(x,y) – FALSE

16) (∀y)(∃x)greaterthan(x,y) – TRUE

17) (∃x)(∀y)greaterthan(x,y) – FALSE

18) (∀x)(positive(x)∧greaterthan(0,x)) – FALSE

14) (∀x)(positive(x)∧greaterthan(x,0)) – FALSE
16) (∃x)(positive(x)∧greaterthan(x,0)) – TRUE
17) (∃x)(positive(x)∧greaterthan(0,x)) – FALSE

18) greaterthan(0,0) – FALSE

QUIZ 3.2

Rule 2 = ^
Rule 3 = v
Rule 4 = ->
Rule 5 = <->
Rule 6 = V
Rule 7 = ]

QUIZ 3.3

(Cube(a) Cube(b) Larger(x,y)) = not well-formed formula

(Cube(a) Cube(b) Larger(x,y)) = not well-formed formula
(Small(w) + Large(w)) = illegal symbol
(a = b) = not well-formed formula
∀xy ((Cube(x) ∧ Cube(y)) → ¬ Larger(x,y)) = not well-formed formula

QUIZ 3.5
Term = 0, 1, (term + term), (term x term)
Atomic wff = term < term, term = term

QUIZ 5.2

RUSSELL
-always translates into logic language
-no P = false
-more than 1 P = false

STRAWSON
-translate into logic language = ALWAYS FALSE
-no P = neither true or false
-more than 1 P = neither true or false

Is the TERRY'S WORLD language sentence " x((circle(x) solid(x)) y((circle(y) solid(y))
x=y))" true or false or neither in the pictured TERRY'S world? – FALSE
(also the left of b one)
Is the TERRY'S WORLD language sentence " x((triangle(x) solid(x)) y((triangle(y) solid(y))
x=y) leftof(x,b))" true or false or neither in the pictured TERRY'S world? – FALSE
(also without left of b one)
QUIZ 6.8
Valid argument:
-logical truth
-logical consequence
-not consistent
-C is NOT logically independent
Invalid argument:

-not logical truth

-not logical consequence
-consistent
-cannot conclude anything about C

-bi-conditional formula not equivalent = not a logical truth

-{F1,F2,F3,...,Fn} inconsistent set = logical falsehood

consistent = logical truth

-equivalent = valid
-not equivalent = nothing can be said about validity

-contingent = nothing can be said about validity

QUIZ 7.1
P = no decomposition rules apply

QUIZ 7.2
BD = no decomposition rules apply
(]x)Gxf & (]y)Hy = non branching, other sentence is regular
((]x)Bx <-> Be) = branching (both branching)
(]x)Jx -> (]y)Ky = branching, other sentence is regular

QUIZ 9.3.1
-all people = form a set YES
-well-known artists = don’t form set NO
-wealthy people = don’t form set NO
-integers greater than 17 = form set YES

-set B {2,3} = 1 element

-set A {2,3} = 2 elements
-set {{},{3,{}}} = 2 elements
-set A =/= set b

QUIZ 9.2.4
-line 8 = 6,IFd
-line 9 = 8,NOTNOTd
-line 10 = 7,IFd

QUIZ 9.3.3
-sa vy = not valid, consistent
-sa ha = not valid, consistent
-ebb = valid
-no set (=S)
-line 7 = 5,IFFd
-line 15/16 = 14,IFFd
-line 17/18 = 13, IFFd

- (]x) becomes Vx = NOTEXISTd