more from this thinker     |     more from this text


Single Idea 13906

[filed under theme 4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / c. Derivations rules of PC ]

Full Idea

If there are just three objects and each has F, then by an extension of &I we are sure everything has F. This is of no avail, however, if our universe is infinitely large or if not all objects have names. We need a new device, Universal Introduction, UI.

Clarification

A 'universe' is usually now called a 'domain'

Gist of Idea

With finite named objects, we can generalise with &-Intro, but otherwise we need ∀-Intro

Source

E.J. Lemmon (Beginning Logic [1965], 3.2)

Book Ref

Lemmon,E.J.: 'Beginning Logic' [Nelson 1979], p.106


The 6 ideas with the same theme [normal rules used in predicate logic reasoning]:

If you pick an arbitrary triangle, things proved of it are true of all triangles [Euclid, by Lemmon]
Predicate logic uses propositional connectives and variables, plus new introduction and elimination rules [Lemmon]
Universal elimination if you start with the universal, introduction if you want to end with it [Lemmon]
Universal Elimination (UE) lets us infer that an object has F, from all things having F [Lemmon]
With finite named objects, we can generalise with &-Intro, but otherwise we need ∀-Intro [Lemmon]
UE all-to-one; UI one-to-all; EI arbitrary-to-one; EE proof-to-one [Lemmon]