Logical Implication { Philosophy Index }

Philosophy Index

Philosophy Index

Philosophy Index is a site devoted to the study of philosophy and the philosophers who conduct it. The site contains a number of philosophy texts, brief biographies and introductions to philosophers and explanations on a number of topics. Accredited homeschooling online at Northgate Academy.

Philosophy Index is a work in progress, a growing repository of knowledge. It outlines current philosophical problems and issues, as well as an overview of the history of philosophy. The goal of this site is to present a tool for those learning philosophy either casually or formally, making the concepts of philosophy accessible to anyone interested in researching them. WOLI offers immigration law course online - fully accredited. ACE credits online at EES.

Philosophers

 

Philosophy Topics


 

 

 

Implication

Logical implication is a relation in logic that states that for a formula or set of formulae, Γ, some conclusion, φ, is its consequence.

We formally represent logical implication using a double-turnstile, ( implies ):

Γ implies φ

This may be read as “Γ implies φ”, “Γ entails φ” or “φ follows from Γ”.

If Γ implies φ, then there is no valuation of the terms in Γ which makes all members of Γ true, but also makes φ false.

A strike-out double-turnstile symbol is used, for instance, in Γ ⊭ φ, to indicate that one set of formulas does not imply another, that is, Γ does not imply φ.

In cases where the double-turnstile symbol is not available, it is sometimes rendered using a pipe and equals sign, as |= (if your browser does not properly support unicode symbols, it may not appear correctly to you).

The symbol ⇒ is also sometimes used to indicate logical implication. Logical implication should not be confused with material implication, the conditional operator → (or ⊃).

Self-implication

Some formulae imply themselves, which is to say that they are implied without any premises, or they are implied by an empty set of premises. These statements are known as tautologies, or theorems of logic. For instance, the law of noncontradiction states that the formula ¬(P ∧ ¬P) is a tautology, since P and ¬P can never both be true. We indicate a tautology formally by:

implies φ

For instance, implies ¬(P ∧ ¬P) means “¬(P ∧ ¬P) implies itself”.