3
<h2>
Exercises to accompany Tutorial 8</h2>
<h3>
Exercise 1 (of 4)
</h3>
<p>
There is a Rule for Absurdity Introduction-- in effect it is just And
Introduction, but with the requirement that the conjuncts contradict
each other. To use it you select a formula, and select the negation of
that formula, and choose <em>Absurd</em>.
</p>
<p>
Derive the following, either with or without Tactics. (Tactics will ask
to you choose where the contradiction will come from; but it also gives
you a hint as to the possibilities by listing all potential positive
conjuncts.)<br>
</p>
<blockquote>
a) F, ∼F ∴ Absurd
</blockquote>
<blockquote>
b) F, F⊃∼F ∴ Absurd
</blockquote>
<blockquote>
c) F,G,∼(F&G) ∴ Absurd
</blockquote>
<blockquote>
d) F, ∼(F⊃F) ∴ Absurd
</blockquote>
<p>
</p>
<h3>
Exercise 2 (of 4)
</h3>
<p>
Derive the following. First use Tactics. Start the derivation, switch on
Tactics under the <em>Wizard</em>, then click ∼I to lay out the
derivation properly. Then repeat the derivations without using Tactics.
</p>
<p>
</p>
<blockquote>
a) F ∴ ∼(∼F)
</blockquote>
<blockquote>
b) F ∴ ∼(∼(∼(∼F))) (*Tactics give you a poor hint here*)
</blockquote>
<blockquote>
c) ∼F ∴ ∼(F&G)
</blockquote>
<blockquote>
d) F&∼G ∴ ∼(F⊃G)
</blockquote>
<blockquote>
e) F&∼G ∴ ∼(F≡G)
</blockquote>
<blockquote>
f) ∴∼(F&(∼F))
</blockquote>
<blockquote>
g) C&(∼F), A&((∼G)&B) ∴ ∼(F&G)
</blockquote>
<p>
</p>
<h3>
Exercise 3 (of 4)
</h3>
<p>
Derive the following. There is a circumstance in which Reductio is used
where the initial target formula in not a negation-- the derivation
proceeds by assuming a negation using Reductio to get a double negation,
then using (double) Negation Elimination to get the desired formula. The
first derivation that follows is an illustration of this.
</p>
<p>
</p>
<p>
</p>
<blockquote>
a) F&(∼F) ∴ G
</blockquote>
<blockquote>
b) ∼(F&G),F,G∴H
</blockquote>
<blockquote>
c) ∴ F∨∼F (*this is difficult, but important-- learn how to do it*)
</blockquote>
<blockquote>
d) ∼(F&G)∴∼F∨∼G
</blockquote>
<p>
</p>
<h3>
Exercise 4 (of 4)
</h3>
<p>
There are a number of important theorems which can be expressed as
equivalences-- here we consider slightly weakened versions of them which
are conditionals.
</p>
<p>
Derive
</p>
<p>
Double Negation
</p>
<blockquote>
a) ∴ F⊃∼∼F
</blockquote>
<p>
Transposition
</p>
<blockquote>
b) ∴ (F⊃G)⊃(∼G⊃∼F)
</blockquote>
<blockquote>
c) ∴(∼G⊃∼F)⊃(F⊃G) (*The automatic theorem prover gives a very long
winded proof of this due to missing the trick about using reductio to
prove the double negation of what you want.*)
</blockquote>
<p>
De Morgan's Laws
</p>
<blockquote>
d) ∴ ∼(F&G)⊃(∼F∨∼G)
</blockquote>
<blockquote>
e) ∴ ∼(F∨G)⊃(∼F&∼G)
</blockquote>
<p>
Implication
</p>
<blockquote>
f) ∴ (F⊃G)⊃(∼F∨G)
</blockquote>
38445true