predicate

Easy Deriver [Herrick 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.

Tutorial 24: The Restrictions on the Quantificational Rules

Logical System

10/13/26

The material explained here is conceptually at a higher level than the earlier tutorials; it also covers relatively rare cases.

Reading

Hausman[2007] Logic and Philosophy Chapter 11

Skills to be acquired:

To understand the concepts of scope, free, bound, and free for. To learn of the restrictions on the quantificational rules

Tutorial 23: The Semantics of Relations

Logical System

The Tutorial

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}

Symbolization Review

Topic
Logical System

10/13/26

Reading

Hausman[2007] Logic and Philosophy Chapter 10

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

Symbolization using the Universal Quantifier (of non relational English)


‘Everything is lovely’ we understand as meaning ‘Whatever thing you may choose, it is lovely’ and this becomes

(x)Lx

Tutorial 22: Symbolizing Relations

Logical System

Reading

Hausman[2007] Logic and Philosophy Chapter 10

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 sentence would be symbolized Tab.


Tutorial 21: Existential Instantiation, and Quantifier Replacement Rules

Logical System

10/13/26

Reading

Hausman[2007] Logic and Philosophy Chapter 9

The Tutorial


Existential Instantiation permits you to remove an existential quantifier from a formula which has an existential quantifier as its main connective.


The circumstance that Existential Instantiation gets invoked looks like this.