| | Natural deduction logic - Wikipedia, the free encyclopedia |
 | | A natural deduction is an instruction on how to use binary logic to move from one line to another, during a linear sequential proof. |
 | | Thus, in order for a reasoning agent to learn that hypothetical syllogism is a valid natural deduction from this deduction(alternatively reasoning event), the reasoning agent had to already know that modus ponens is a natural deduction. |
 | | A reasoning agent who already knows enough natural deductions, so that in principle (memory limitations aside), he can determine whether or not some statement is a natural deduction, is said to be logically omnisicent. |
| en.wikipedia.org /wiki/Natural_deduction_logic (386 words) |