Help with Universal Generalization
2/5/08
Universal Generalizaton
2/5/08
2/3/08 10 Software
Your browser is not displaying the Deriver applet. Try downloading Deriver itself by clicking on the link elsewhere on the page.
1/29/08
To become familiar with the new rules for predicate logic trees.
A. Hausman, H.Kahane, P.Tidman, [2007] Logic and Philosophy Chapter 12
There are further rules for predicate logic trees (which we will come to shortly).
2/5/08
If a derivation contains a line of the form
n (<variable>)<scope> <any justification>
then a line of the form
<<scope>[<term>/<variable>]> 'n UI'
may be added to the derivation, provided that <variable> is free for <term> in the <scope> ie that the substitution [<term>/<variable>] is legitimate .
11/9/2007 10Software
The semantics of relations proceeds in much the way one would expect-- the new item that has to be taken account of is the order of the terms (because, for example, Tab is not at all the same thing as Tba -- Arthur being taller than Beryl is not the same as Beryl being taller than Arthur).
Let us start with an Interpretation
Interpretation 1
Universe= {a,b}
F={a}
10 Software
Hausman[2007] Logic and Philosophy Chapter 10
Thus far we have considered only 'monadic' predicates-- our atomic formulas consist of a predicate followed by only one term-- for example, Fx. But in English we regularly encounter dyadic predicates or relations. For example, 'Arthur is taller than Bert' cannot be symbolized with the tools we have used so far; what is needed is a relation to represent '...is taller than ...' Txy, say, and then the proposition would be symbolized Tab.
2/5/08 10Software
Hausman[2007] Logic and Philosophy Chapter 9
Existential Instantiation permits you to remove an existential quantifier from a formula which has an existential quantifier as its main connective.
The circumstance that Existential Instantiation gets invoked looks like this.
2/5/08 10Software
Hausman[2007] Logic and Philosophy Chapter 9
There is a rule for adding a Existential Quantifier. This permits the step illustrated by the following proof fragments.
5 Fa 6 (∃x)Fx 5 EG