Skip to main content
search

In symbolic logic, a valid inference in a system of quantifier rules. A universal claim is derived from the assumption of a hypothetical or arbitrarily chosen name (object) at the outset of a sub proof. From this assumption, an instance is derived, at which point the sub proof is closed and the universal claim is proved. (See also General conditional proof.)