| |
| | Automated Reasoning |
 | | Some of the main obstacles: First, LK does not specify the order in which the rules must be applied in the construction of a proof tree. |
 | | Second, and as a particular case of the first problem, the premises in the rules ∀→ and →∃ rules inherit the quantificational formula to which the rule is applied, meaning that the rules can be applied repeatedly to the same formula sending the proof search into an endless loop. |
 | | Third, LK does not indicate which formula must be selected next in the application of a rule. |
| plato.stanford.edu /entries/reasoning-automated (12208 words) |
|