|
Size: 897
Comment:
|
Size: 939
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| [[BR]] | |
| Line 3: | Line 2: |
| {{{#!latex2 | {{{#!latex |
| Line 10: | Line 9: |
| 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$. | where X represents some set of premises and y represents the conclusion. This simply means that the conjuction of all the premises entails the conclusion. We say that $X \models y$ if and only if all the models of $X$ are models of $y$.\bigskip |
| Line 12: | Line 11: |
| To show $X \models y$, show that $X \Rightarrow y$ is a tautology. We call a tautology of the form $A \models B$ a Logical Implication. | To show $X \models y$, show that $X \Rightarrow y$ is a tautology. We call a tautology of the form $A \models B$ a Logical Implication.\bigskip |
| Line 14: | Line 13: |
| In predicate calculus, we use [[latex2($$\vdash$$)]] to denote deduction | In predicate calculus, we use $\vdash$ to denote deduction |
| Line 18: | Line 17: |
| 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) | where $\nabla$ represents the set of assumptions and $Q$ represents the conclusion. This expression reads ''$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. |
| Line 20: | Line 19: |
| (FirstOrderMathematicalLogicAngeloMargaris) |
\section{Logical Implication or Entailment}
Consider
\[
X \models y
\]
where X represents some set of premises and y represents the conclusion. This simply means that the conjuction of all the premises entails the conclusion. We say that $X \models y$ if and only if all the models of $X$ are models of $y$.\bigskip
To show $X \models y$, show that $X \Rightarrow y$ is a tautology. We call a tautology of the form $A \models B$ a Logical Implication.\bigskip
In predicate calculus, we use $\vdash$ to denote deduction
\[
\nabla \vdash Q
\]
where $\nabla$ represents the set of assumptions and $Q$ represents the conclusion. This expression reads ''$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