symbolization

10 Software

The Tutorial

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.

6/18/07 10 Software

Skill to be acquired in this tutorial:

To learn how to use the Universal and Existential Quantifiers in symbolizing propositions.

Reading

Bergmann[2008] The Logic Book Sections 7.4

The Tutorial

In Predicate Logic there are two new logical connectives, the Universal Quantifier (∀x) and the Existential Quantifier (∃x). These are used for symbolizing certain English constructions (they also have their own rules of inference and their own semantics, which we will learn about later).

10 Software

In predicate logic, many different styles of expression in English get cast into the same 'property-is-had-by-entity' form. For example,

6/14/07 10 Software

Skills to be acquired in this tutorial:

To start learning how to symbolize sentences using predicate logic.

Reading

Bergmann[2008] The Logic Book Sections 7.1-7.3

The Tutorial:

There are many valid arguments which cannot be shown to be valid using sentential logic alone. For example,

Beryl is a philosopher.
All philosophers are wise.
Therefore
Beryl is wise.

Example only

Tutorial 16 Symbolization using the quantifiers.

1/27/09 10 Software

Skill to be acquired in this tutorial:

To learn how to use the Universal and Existential Quantifiers in symbolizing propositions.

8/11/26

Skills to be acquired in this tutorial:

To start to learn about identities, the semantics of identities, and typical expressions in English that might use identities.

Why this is useful:

Reasoning with identity is vital for mathematics, philosophy, and many other areas.

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:

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.

11/30/06

[The core of this is from Leblanc and Wisdom [1972] p.117 and f.]

Symbolization using the Universal Quantifier (of non relational English)