| |
| | [No title] |
 | | The logical consequence relation is defined in terms of the semantics of the predicate calculus, which are too complicated for us to explore here. |
 | | However, the definition of the logical consequence relation and the inference rules are arranged so that for any wff's $p_{1},p_{2},\ldots,p_{k}$, and $q$, \[ p_{1},p_{2},\ldots,p_{k}\vdash q \mbox{ if and only if } p_{1},p_{2},\ldots,p_{k}\models q \] so that we may use the notions of deducibility and entailment interchangeably. |
 | | Since we could recognize instances of logical consequence in the propositional logic but can only generate them in the predicate calculus, we are computationally in a weaker position in the predicate calculus than in the propositional logic. |
| www.cs.usm.maine.edu /class/cos480/discrete.tex (12501 words) |
|