|
Size: 760
Comment:
|
← Revision 22 as of 2020-02-02 17:44:06 ⇥
Size: 925
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| Consider | Consider |
| Line 5: | Line 5: |
| [[latex2($$X \models y$$)]] | $$$X \models y$$$ |
| Line 7: | Line 7: |
| 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$)]]. | 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$$. |
| Line 9: | Line 9: |
| To show [[latex2($$X \models y$$)]], show that [[latex2($$X \Rightarrow y$$)]] is a tautology. | 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. |
| Line 11: | Line 11: |
| We call a tautology of the form [[latex2($$A \models B$$)]] a Logical Implication. | In predicate calculus, we use $$\vdash$$ to denote deduction |
| Line 13: | Line 13: |
| 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!!!) | $$$\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) |
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$$.
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.
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