Philosophy/PS2 - Revision history

192.168.1.134: 8b

2009-02-13T19:29:22Z

192.168.1.134: 8a

2009-02-13T19:26:22Z

Lensovet: 7 part 2

2009-02-12T03:17:36Z

7 part 2

Lensovet: 7 part 1

2009-02-12T03:06:33Z

7 part 1

Lensovet: 6

2009-02-12T02:51:13Z

Show changes

169.229.13.91: 5

2009-02-11T22:50:20Z

169.229.13.91: 4

2009-02-11T22:45:08Z

169.229.13.91: 3

2009-02-11T22:34:48Z

169.229.13.91: #1-2

2009-02-11T22:22:32Z

#1-2

New page

1. The schemata is not valid if we can find just one assignment of truth-values for which it is false.
(a) p = T, q = F, r = T makes the schemata false. Not valid.
(b) The only way to make this false is for p ⊃ r to be false and p ⊃ q.r to be true. This fixes p to T and r to F. However fixing r to F makes p ⊃ q.r false as well (regardless of the value of q), so it is impossible to make the antecedent true and consequent false here. Thus schemata is valid.
(c) Making the schemata false requires each of the disjuncts being false. To make first one false, fix p to T and q to F (or the opposite, makes no difference). To make second one false, r must be made F since p is already fixed. Thus r and q have the same truth-value and the last disjunct evaluates to true. Again, impossible to make an assignment of truth-values giving us a false statement, so schemata is valid.

2. (i) An assignment of p = q = r = F gives a value of false to the entire schemata, so it is satisfiable but not valid. (ii) An assignment of p = T, q = r = F gives a value of false to the entire schemata so it is also not valid. Thus we cannot easily say if one implies the other based on validity.
(i) does not imply (ii) as p = T, q = r = F is false for (ii) but true for (i). (ii) does not imply (i) as p = q = r = F is false for (i) but true for (ii).

3. Neither the President is happy nor is Congress placated; The President is not happy or Congress is placated.

4.
(a) George will cut down a tree . (George will marry Martha ∨ George will die a bachelor)
(b) (Abe will not become mayor . city will not prosper) ∨ (Abe will become mayor . Ava will become head of chamber of commerce)
(c) (Steve escapes the country ∨ Steve befriends Sally) ⊃ Steve will be safe
(d) (-Jerry stays in town . -Joan reappears) ⊃ Jan will triumph . Jan will convince Joe
(e) (-French object to pact . -Belgians object to pact) . Italian forces withdraw from Spain . attacks on British ships cease ⊃ Italo-British pact will take effect
(f) (-Mail-order campaign breaks Dripsweet monopoly . -mail-order campaign restores competition) ⊃ Jones will mortgage his home ∨ (Jones will sell his car . Jones will sell his boat)

5.
(a)
{|
! p || q || r || p.-r || p.q || p.q ⊃ r || p.-r ∨ (p.q ⊃ r)
|-
|T || T || T || F || T || T || T
|-
|T || T || F || T || T || F || T
|-
|T || F || T || F || F || T || T
|-
|T || F || F || T || F || T || T
|-
|F || T || T || F || F || T || T
|-
|F || T || F || F || F || T || T
|-
|F || F || T || F || F || T || T
|-
|F || F || F || F || F || T || T
|}
(b)
{|
! p || q || r || s || -p.-q || q.-s || p.-r.s || -p.-q ∨ q.-s ∨ p.-r.s
|-
| T || T || T || T || F || F || F || F
|-
| T || T || T || F || F || T || F || T
|-
| T || T || F || T || F || F || T || T
|-
| T || T || F || F || F || T || F || T
|-
| T || F || T || T || F || F || F || F
|-
| T || F || T || F || F || F || F || F
|-
| T || F || F || T || F || F || T || T
|-
| T || F || F || F || F || F || F || F
|-
| F || T || T || T || F || F || F || F
|-
| F || T || T || F || F || T || F || T
|-
| F || T || F || T || F || F || F || F
|-
| F || T || F || F || F || T || F || T
|-
| F || F || T || T || T || F || F || T
|-
| F || F || T || F || T || F || F || T
|-
| F || F || F || T || T || F || F || T
|-
| F || F || F || F || T || F || F || T
|}
(c)
{|
! p || q || r || (p∨q)≡-r || p∨(-q ⊃ r) || (p∨q)≡-r . p∨(-q ⊃ r)
|-
|T || T || T || F || T || F
|-
|T || T || F || T || T || T
|-
|T || F || T || F || T || F
|-
|T || F || F || T || T || T
|-
|F || T || T || F || T || F
|-
|F || T || F || T || T || T
|-
|F || F || T || T || T || T
|-
|F || F || F || F || F || F
|}

6.
(a)
{|
! p || p || p$p
|-
|T || T || F
|-
|F || F || F
|}
(b)
{|
! q || p || q$p
|-
|T || T ||
|-
|T || F ||
|-
|F || T ||
|-
|F || F ||
|}
(c)
{|
! p || q || p$q || (p$q)$p
|-
|T || T ||
|-
|T || F ||
|-
|F || T ||
|-
|F || F ||
|}
(d)
{|
! p || q || r || (p$q)$r
|-
| T || T || T ||
|-
| T || T || F ||
|-
| T || F || T ||
|-
| T || F || F ||
|-
| F || T || T ||
|-
| F || T || F ||
|-
| F || F || T ||
|-
| F || F || F ||
|}
(e)
{|
! p || q || r || (p⊃r) || (p⊃r)$q
|-
| T || T || T ||
|-
| T || T || F ||
|-
| T || F || T ||
|-
| T || F || F ||
|-
| F || T || T ||
|-
| F || T || F ||
|-
| F || F || T ||
|-
| F || F || F ||
|}

7. (a)
{|
! p || p || r || (p⊃r) || (p⊃p) . (p⊃r)
|-
| T || T || T ||
|-
| T || T || F ||
|-
| F || F || T ||
|-
| F || F || F ||
|}
(b)
{|
! p || r || q || (r⊃q) || (p⊃q) || (r⊃q) . (p⊃q)
|-
| T || T || T ||
|-
| T || T || F ||
|-
| T || F || T ||
|-
| T || F || F ||
|-
| F || T || T ||
|-
| F || T || F ||
|-
| F || F || T ||
|-
| F || F || F ||
|}
(c)
{|
! p || r || q || (p⊃f(p,q,p)) || (q⊃f(p,q,p)) || (p⊃f(p,q,p)) . (q⊃f(p,q,p))
|-
| T || T || T ||
|-
| T || T || F ||
|-
| T || F || T ||
|-
| T || F || F ||
|-
| F || T || T ||
|-
| F || T || F ||
|-
| F || F || T ||
|-
| F || F || F ||
|}
(d)
{|
! p || r || q || ((p⊃q)⊃r) || ((q⊃p)⊃r) || ((p⊃q)⊃r) . ((q⊃p)⊃r)
|-
| T || T || T ||
|-
| T || T || F ||
|-
| T || F || T ||
|-
| T || F || F ||
|-
| F || T || T ||
|-
| F || T || F ||
|-
| F || F || T ||
|-
| F || F || F ||
|}

8.
(a) Yes, as the truth-values for s#-t and -s#t are the same.
(b)
{|
! s || t || u || (s#t) || (s#t)#u || t#u || s#(t#u)
|-
| T || T || T ||
|-
| T || T || F ||
|-
| T || F || T ||
|-
| T || F || F ||
|-
| F || T || T ||
|-
| F || T || F ||
|-
| F || F || T ||
|-
| F || F || F ||
|}

9. (a) Compare the values of the 2nd and 3rd rows; if they are equivalent, then # is commutative. Otherwise, it isn't.
(b) Say P and Q are equivalent, i.e. both true. Then, for a connective to be anti-commutative, that means that P#Q is equivalent to -(Q#P). However, this is impossible as P#Q and Q#P are equivalent, so the negation of the latter cannot be equivalent to the former.

10.
(a) No. Say p = "God exists", but there is actually no God. Many people believe God exists is true. Say p = "oceans are blue", which they are. Many people believe oceans are blue is true. Thus the truth value of the statement depends on more than just the truth-value of its single component.
(b) No. Say p = "the sun's gravitational field exerts an attractive force on all objects", q = "some frogs are green"; then the whole statement is false. However, say p remains the same and q = "the planets orbit around the sun"; then, the whole statement is true. Thus the whole statement can be both true and false if p & q are both true, and it is not truth-functional as the truth-values of p & q alone do not determine its truth value.
(c) Yes; this is simply the "not" connective, whose output depends solely on the truth value of the input.

← Older revision		Revision as of 19:29, 13 February 2009
Line 119:		Line 119:
	\|F \|\| F \|\| F \|\| T		\|F \|\| F \|\| F \|\| T
	\|}		\|}
		+
		+	(b) Yes; for φ(p,p,p) = F, p = F as well.
		+	Yes; for φ(q,p,q) = F, p = F as well.
		+	No; there are two cases in which φ(p,φ(q,p,q),q) = F, and p = F for only one of them. Thus p = T, q = F gives us φ(p,φ(q,p,q),q) = F while p = T, so implication does not hold.

@@ Line 65: / Line 65: @@
 |}
 Thus we can see that #1, 2, and 4 are equivalent to p.q⊃r while #3 is equivalent to p∨q⊃r
 .

@@ Line 11: / Line 11: @@
 (c) Yes. q = T, r = F, p = T makes the second schema false, and is the only assignment that does. It also makes the first schema false, so the first implies the second.
-.For (2) to be false, q = T and u = F. We can try to find an assignment of the other variables that will make (1) true. For p ⊃ (q⊃r.(s∨t)) to be true, r = s = t = T. In this case, (-p.q.∨r.s∨r.t)⊃u becomes false, so the conjunct is false as well. Any other assignments of r, s, and t will make the first part of the conjunct false, thus making the entire conjunct false. Thus for all truth-values making (2) false, (1) is false as well, and (1) implies (2).
+. For (2) to be false, q = T and u = F. We can try to find an assignment of the other variables that will make (1) true. For p ⊃ (q⊃r.(s∨t)) to be true, r = s = t = T. In this case, (-p.q.∨r.s∨r.t)⊃u becomes false, so the conjunct is false as well. Any other assignments of r, s, and t will make the first part of the conjunct false, thus making the entire conjunct false. Thus for all truth-values making (2) false, (1) is false as well, and (1) implies (2).
-.
+. First schematize the statements.
-(a)
+p = prices are low
-{|
+q = sales are high
-! p || q || r || p.-r || p.q || p.q ⊃ r || p.-r ∨ (p.q ⊃ r)
+r = you sell quality merch
-|-
+s = your customers are satisfied
-|T || T || T || F || T || T || T
-|-
+(i) becomes (p ⊃ q) . (r ⊃ s); (ii) becomes (p ∨ r) ⊃ (q ∨ s).
-|T || T || F || T || T || F || T
+(ii) is false when p∨r = T and q∨s = F. This means that q = s = F and p != r. q and s being false makes (i) false regardless of the values of p and r, so (i) implies (ii).
 .

@@ Line 11: / Line 11: @@
 (c) Yes. q = T, r = F, p = T makes the second schema false, and is the only assignment that does. It also makes the first schema false, so the first implies the second.
-.
+.For (2) to be false, q = T and u = F. We can try to find an assignment of the other variables that will make (1) true. For p ⊃ (q⊃r.(s∨t)) to be true, r = s = t = T. In this case, (-p.q.∨r.s∨r.t)⊃u becomes false, so the conjunct is false as well. Any other assignments of r, s, and t will make the first part of the conjunct false, thus making the entire conjunct false. Thus for all truth-values making (2) false, (1) is false as well, and (1) implies (2).
 .

← Older revision		Revision as of 19:26, 13 February 2009
Line 87:		Line 87:
	Thus we can see that #1 is equivalent to r⊃p.q and #2 is equivalent to r⊃p∨q		Thus we can see that #1 is equivalent to r⊃p.q and #2 is equivalent to r⊃p∨q

−	8.	+	8. (a)
		+	{\|
		+	! p \|\| φ(p,p,p)
		+	\|-
		+	\|T \|\| T
		+	\|-
		+	\|F \|\| F
		+	\|}
		+
		+	{\|
		+	! p \|\| q \|\| φ(q,p,q)
		+	\|-
		+	\|T \|\| T \|\| T
		+	\|-
		+	\|T \|\| F \|\| T
		+	\|-
		+	\|F \|\| T \|\| T
		+	\|-
		+	\|F \|\| F \|\| F
		+	\|}
		+
		+	{\|
		+	! p \|\| φ(q,p,q) \|\| q \|\| φ(p,φ(q,p,q),q)
		+	\|-
		+	\|T \|\| T \|\| T \|\| T
		+	\|-
		+	\|T \|\| T \|\| F \|\| F
		+	\|-
		+	\|F \|\| T \|\| T \|\| F
		+	\|-
		+	\|F \|\| F \|\| F \|\| T
		+	\|}

@@ Line 45: / Line 45: @@
 .
-(a)
+{|
 .

@@ Line 1: / Line 1: @@
-. The schemata is not valid if we can find just one assignment of truth-values for which it is false.
+. The schema is not valid if we can find just one assignment of truth-values for which it is false.
-(a) p = T, q = F, r = T makes the schemata false. Not valid.
+(a) p = T, q = F, r = T makes the schema false. Not valid.
-(b) The only way to make this false is for p ⊃ r to be false and p ⊃ q.r to be true. This fixes p to T and r to F. However fixing r to F makes p ⊃ q.r false as well (regardless of the value of q), so it is impossible to make the antecedent true and consequent false here. Thus schemata is valid.
+(b) The only way to make this false is for p ⊃ r to be false and p ⊃ q.r to be true. This fixes p to T and r to F. However fixing r to F makes p ⊃ q.r false as well (regardless of the value of q), so it is impossible to make the antecedent true and consequent false here. Thus schema is valid.
-(c) Making the schemata false requires each of the disjuncts being false. To make first one false, fix p to T and q to F (or the opposite, makes no difference). To make second one false, r must be made F since p is already fixed. Thus r and q have the same truth-value and the last disjunct evaluates to true. Again, impossible to make an assignment of truth-values giving us a false statement, so schemata is valid.
+(c) Making the schema false requires all of the disjuncts to be false. To make first one false, fix p to T and q to F (or the opposite, makes no difference). To make second one false, r must be made F since p is already fixed. Thus r and q have the same truth-value and the last disjunct evaluates to true. Again, impossible to make an assignment of truth-values giving us a false statement, so schema is valid.
 . (i) An assignment of p = q = r = F gives a value of false to the entire schemata, so it is satisfiable but not valid. (ii) An assignment of p = T, q = r = F gives a value of false to the entire schemata so it is also not valid. Thus we cannot easily say if one implies the other based on validity.
 (i) does not imply (ii) as p = T, q = r = F is false for (ii) but true for (i). (ii) does not imply (i) as p = q = r = F is false for (i) but true for (ii).
-. Neither the President is happy nor is Congress placated; The President is not happy or Congress is placated.
+. (a) No. p ⊃ q is false if p = T and q = F, but (p⊃r)⊃(q⊃r) is true with those assignments.
 .