predicate

Help with the semantics of free variables

Logical System

12/25/06

Introduction to Free Variables

This video illustrates use of the downloadable application (and the symbol ∧ for 'and' and (∀x) for the universal quantifier, some systems use (x) for this). But, what the film depicts and explains is equally good if you happen to be using the web pages applets (or different symbols for 'and' and the universal quantifier).

Review of New Material

Topic
Logical System

Review of new material

A start can be made in predicate logic by taking apart 'atomic' propositions and by re-phrasing what they have to say in a 'entity-has-property' way.

The constant terms a,b,c...h are used to denote entities, the predicates A,B,C...Z are used to denote properties that these entities have, and these are put together by writing the predicate first followed by the term, for example Gb.

Try your own derivations

Logical System
12/28/20

Roll your own derivations

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 ∼ ∧ ∨ ⊃ ≡ ∀ ∃ ∴

Deriver [Functional Terms, Identity, First Order Theories, Set Theory—Gentzen Syntax]

Logical System
12/19/20

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:

Easy Deriver [Copi Syntax]

Logical System

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.