Liste des Groupes | Revenir à s logic |
This is Peirce law:We have gone over that already. Either you have memory problems or you are purposely flooding the channel at this point.
((p->q)->p)->p
Peirce law is not provable in minimal logic.
But I guess this is not Glivenko:
notation(dnt(X), ~X->(~(~X)))
https://en.wikipedia.org/wiki/Double-negation_translation#Propositional_logic
Glivenko would be simply:
notation(gliv(X), (~(~X)))
Les messages affichés proviennent d'usenet.