Differences between revisions 6 and 9 (spanning 3 versions)
Revision 6 as of 2006-07-18 23:41:16
Size: 760
Editor: yakko
Comment:
Revision 9 as of 2007-02-16 02:06:57
Size: 900
Editor: yakko
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
= Logical Implication or Entailment = {{{#!latex2
\section{
Logical Implication or Entailment}
Line 3: Line 4:
Consider Consider
\[
    X \models y
\]
where X is some set of premises and y is the conclusion. This simply means that the conjuction of all the premises entail the conclusion. We say that $X \models y$ if and only if all the models of $X$ are models of $y$.
Line 5: Line 10:
[[latex2($$X \models y$$)]] To show $X \models y$, show that $X \Rightarrow y$ is a tautology. We call a tautology of the form [[latex2($$A \models B$$)]] a Logical Implication.
Line 7: Line 12:
where X is some set of premises and y is the conclusion. This simply means that the conjuction of all the premises entail the conclusion. We say that [[latex2($X \models y$)]] if and only if all the models of [[latex2($X$)]] are models of [[latex2($y$)]].

To show [[latex2($$X \models y$$)]], show that [[latex2($$X \Rightarrow y$$)]] is a tautology.

We call a tautology of the form [[latex2($$A \models B$$)]] a Logical Implication.

In predicate calculus, we often times use [[latex2($$\vdash$$)]] to denote logical implication. In this case we must prove that the predicate calculus expression is valid. (Update this!!!)
In predicate calculus, we use [[latex2($$\vdash$$)]] to denote deduction
\[
     \nabla \vdash Q
\]
where $\nabla$ is the set of assumptions and $Q$ is the conclusion is read ''$Q$ is deduced from $\nabla$.'' If $\nabla = \emptyset$, often denoted $\vdash Q$, then it is call a proof. That is $Q$ is deduced soley from the axioms. (FirstOrderMathematicalLogicAngeloMargaris)
}}}

\section{Logical Implication or Entailment}

Consider 
\[
    X \models y
\]
where X is some set of premises and y is the conclusion. This simply means that the conjuction of all the premises entail the conclusion. We say that $X \models y$ if and only if all the models of $X$ are models of $y$.

To show $X \models y$, show that $X \Rightarrow y$ is a tautology. We call a tautology of the form [[latex2($$A \models B$$)]] a Logical Implication.

In predicate calculus, we use [[latex2($$\vdash$$)]] to denote deduction
\[
     \nabla \vdash Q
\]
where $\nabla$ is the set of assumptions and $Q$ is the conclusion is read ''$Q$ is deduced from $\nabla$.'' If $\nabla = \emptyset$, often denoted $\vdash Q$, then it is call a proof. That is $Q$ is deduced soley from the axioms. (FirstOrderMathematicalLogicAngeloMargaris)

See LogicNotes

Back to ComputerTerms

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