derivations
Tutorial 24: The restrictions on the quantificational rules
4/9/06 10Software
Skill to be acquired:
To understand the concepts of scope, free, bound, and free for.
Why this is useful:
The new predicate rules of inference using quantifiers have restrictions on them which are expressed in terms of these concepts.
Quiz 8 [Tutorial 21]
10/29/06
Quiz 8 Applet
Tutorial 21: Existential Instantiation
10Software
The Tutorial
Existential Instantiation permits you to remove an existential quantifier from a formula which has an existential quantifier as its main connective. It is one of those rules which involves the adoption and dropping of an extra assumption (like ∼I,⊃I,∨E, and ≡I).
The circumstance that Existential Instantiation gets invoked looks like this.
Tutorial 20: Simplified Existential Generalization
3/31/06 10Software
The Tutorial
There is a rule for adding a Existential Quantifier. This permits the step illustrated by the following proof fragments.
Tutorial 19: Universal Generalization
10Software
The Tutorial
There also is a rule for adding a Universal Quantifier. This permits the step illustrated by the following proof fragments.
Tutorial 18: Simplified Universal Instantiation
3/4/06 10Software
Skill to be acquired:
To understand the concepts of scope, free, bound. To meet substitution and a simplified version of the rule for removing a Universal Quantifier.
Tutorial 15: Elementary derivations in predicate logic
2013
The Tutorial
The propositional rules of derivation carry over unchanged into Predicate Logic
If you can see this, your browser does not understand IFRAME.-->
Predicate Logic: 15 Tutorials
There are many valid arguments which cannot be shown to be valid using propositional logic alone. For example,
Beryl is a philosopher.
All philosophers are wise.
Therefore
Beryl is wise.
Easy Deriver [Hausman Syntax]
10/8/26
Welcome!
These web pages provide an introduction to logic to the level of Propositional and Predicate Calculus.
The focus of the program is on arguments and the question of whether they are valid. Arguments have the form <list of premises> ∴<conclusion>. An argument is valid if and only if it is not possible for all its premises to be true and its conclusion false at one and the same time; an argument which is not valid is invalid.