symbolization

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)

10 Software

Tutorial 22 Symbolizing Relations.

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.

Tutorial 16 Symbolization using the quantifiers.

2013

Skill to be acquired in this tutorial:

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

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).

2013

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.

2013

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

8/13/26

Skills to be acquired in this tutorial:

To start learning how to symbolize propositions using predicate logic.

The Tutorial:

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.

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.

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.

8/29/06

Tutorial 2 Example: How Experts Symbolize