Single Idea 13904

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

Full Idea

Our rule of universal quantifier elimination (UE) lets us infer that any particular object has F from the premiss that all things have F. It is a natural extension of &E (and-elimination), as universal propositions generally affirm a complex conjunction.

Gist of Idea

Universal Elimination (UE) lets us infer that an object has F, from all things having F

Source

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

Book Reference

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