HomeContents: |
## 19 Summary (Ad)## IntroductionPeirce's rules of inference form a system of logic that is equivalent to First Order Predicate Logic. They can be used to reason using conceptual graphs. ## Negative contextsA context is negative if it has the "not" symbol () in front of it. ## Evenly enclosed, oddly enclosedA graph is said to be ## Dominating contextA context x is said to dominate a context y if y is nested somewhere inside x. ## The five rulesThe five rules are: - Erasure:
- Any evenly enclosed graph may be erased.
- Insertion:
- Any graph may be inserted in any oddly enclosed context.
- Iteration:
- A copy of any graph u may be inserted into the same context in which u occurs or into any context dominated by a concept in u.
- Deiteration:
- Any graph whose occurrence could be the result of iteration may be erased (i.e., if it is identical to another graph in the same context or in a dominating context).
- Double negation:
- A double negation may be drawn around or removed from any graph or set of graphs in any context.
Prev: 18 Another example of usage (Ad)Up: Part IV: Peirce's rules (Ad)Next: 20 The end |