| S. Morishita, Lattice-valued Programs, TRL Research Report, TR87-0041, IBM Tokyo Research Laboratory, 5-19 Sanbancho, Chiyoda-ku, Tokyo 102 (1988). |
....[0, 1] with the standard ordering, also satisfies the infinitary distributive laws, and hence the Theorem applies to the bilattice [0, 1] # [0, 1] This is an example that will concern us below. Clearly many other examples exist. Incidentally, the Theorem above fits nicely into the framework of [18]. The preliminary Lemmas can be looked at as establishing that the framework of that paper is appropriate. Bilattices In Logic Programming 11 6 Smullyan style propositional rules In [19] Smullyan presented a proof procedure for classical logic using signed formulas in semantic tableaux. A ....
S. Morishita, Lattice-valued Programs, TRL Research Report, TR87-0041, IBM Tokyo Research Laboratory, 5-19 Sanbancho, Chiyoda-ku, Tokyo 102 (1988).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC