Differences between revisions 2 and 3
⇤ ← Revision 2 as of 2003-10-03 19:48:00 →
Size: 372
Editor: yakko
Comment:
← Revision 3 as of 2003-10-08 23:43:32 → ⇥
Size: 527
Editor: yakko
Comment:
Deletions are marked like this. Additions are marked like this.
Line 13: Line 13:
In predicate calculus, we often times use |- to denote logical implication. In this case we must prove that the predicate calculus expression is valid.

Logical Implication

Consider

  • X |= y

where X is some set of premises and y is the conclusion. This simply means that the conjuction of all the premises logically implies the conclusion.

To show X |= y, show that X => y is a tautology.

Therefore a tautology of the form A |= B is called a Logical Implication.

In predicate calculus, we often times use |- to denote logical implication. In this case we must prove that the predicate calculus expression is valid.

See LogicNotes

Back to ComputerTerms

LogicalImplication (last edited 2020-02-02 17:44:06 by scot)