Welcome!
The tutorials presented here look at some topics in logic to the level of intermediate to advanced Predicate Calculus. They build on the Tutorials of Easy Deriver which provided the introductory material to Propositional and Predicate Calculus.
The program, widgets, or Notes, should be accompanied by a suitable textbook, such as:
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.
2013
You may have derivations of your own that you wish to try. Just type, paste, or drag and drop, them into the panel, select your derivation, and click 'Start from selection'. [Often copy-and-paste won't work directly from a Web Page; however, usually drag-and-drop will work!]
You will need to use the correct logical symbols. Here they are
F ∴ F ∧ G ∼ ∧ ∨ ⊃ ≡ ∀ ∃ ∴ (or use the palette to produce them)
4/24/06
4/24/06
4/24/06
4/24/06
4/9/06 10Software
To understand the concepts of scope, free, bound, and free for.
The new predicate rules of inference using quantifiers have restrictions on them which are expressed in terms of these concepts.
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}