Liste des Groupes | Revenir à s logic |
In affine logic you can possibly do something like iterativeYeah, something like that, but I am pretty sure we can do better than just trial and error.
deepening, only its iterative contraction.
Define A^n o- B as:
A o- A o- .. A o- B
\-- n times --/
The running the prover with this notation:
A -> B := A^n o- B
repeatedly with increasing n .
Les messages affichés proviennent d'usenet.