One-stop reference, self-contained, with theoretical topics presented in conjunction with implementations for which code is supplied.Similarly the following equivalences, which we check in OCaml, show that {:7 l} is also adequate: forall tautology [alt;alt;true alt;=agt; false ... ((p ==agt; q) ==agt; (q ==agt; p) ==agt; false) ==agt; falseagt;agt;];; a : bool = true Is any single connective alone enough to express all the others? ... However, either of the other two is adequate alone: the a#39; not anda#39; operation p NAND q I a(p /\ q), or the a#39;not ora#39; operation p NOR q I a\(p \/ q), anbsp;...

Title | : | Handbook of Practical Logic and Automated Reasoning |

Author | : | John Harrison |

Publisher | : | Cambridge University Press - 2009-03-12 |

Continue