<div class="notebook"> <div class="nb-cell html" name="htm1"> Some propositional Logic related Prolog notebooks<br> </div> <div class="nb-cell program" data-singleline="true" name="p1"> /* * Warranty * Liability * To the extent permitted by applicable law and unless explicitly * otherwise agreed upon, XLOG Technologies GmbH makes no warranties * regarding the provided information. XLOG Technologies GmbH assumes * no liability that any problems might be solved with the information * provided by XLOG Technologies GmbH. * * Rights * License * All industrial property rights regarding the information - copyright * and patent rights in particular - are the sole property of XLOG * Technologies GmbH. If the company was not the originator of some * excerpts, XLOG Technologies GmbH has at least obtained the right to * reproduce, change and translate the information. * * Reproduction is restricted to the whole unaltered document. Reproduction * of the information is only allowed for non-commercial uses. Selling, * giving away or letting of the execution of the library is prohibited. * The library can be distributed as part of your applications and libraries * for execution provided this comment remains unchanged. * * Restrictions * Only to be distributed with programs that add significant and primary * functionality to the library. Not to be distributed with additional * software intended to replace any components of the library. * * Trademarks * Jekejeke is a registered trademark of XLOG Technologies GmbH. */ </div> <div class="nb-cell html" name="htm2"> <b>Valuation of propositional formula</b><br> <a href="https://swish.swi-prolog.org/p/Valuation.swinb">Valuation</a><br> <b>Valuation of propositional formula</b><br> With dynamic table<br> <a href="https://swish.swi-prolog.org/p/Valuation2.swinb">Valuation2</a><br> <br> <b>Boole's Method from 1847</b><br> Implementation with Prolog logical variables<br> <a href="https://swish.swi-prolog.org/p/Boole.swinb">Boole</a><br> <b>Boole's Method from 1847</b><br> Implementation with Prolog atoms and proof object<br> <a href="https://swish.swi-prolog.org/p/Boole2.swinb">Boole2</a><br> <br> <b>Find a Hilbert proof in minimal propositional logic</b><br> <a href="https://swish.swi-prolog.org/p/Hilbert.swinb">Hilbert</a><br> <b>Find a Hilbert proof in minimal propositional logic</b><br> Using write statements<br> <a href="https://swish.swi-prolog.org/p/Hilbert2.swinb">Hilbert2</a><br> <b>Find a Hilbert proof in variety of propositional logics</b><br> <a href="https://swish.swi-prolog.org/p/Hilbert3.swinb">Hilbert3</a><br> <b>Find a Hilbert proof in variety of propositional logics</b><br> Using write statements<br> <a href="https://swish.swi-prolog.org/p/Hilbert4.swinb">Hilbert4</a><br> <br> <b>Boolean Ring normal form</b><br> <a href="https://swish.swi-prolog.org/p/Ring.swinb">Ring</a><br> <b>Boolean Ring normal form</b><br> Shown as Reed Muller<br> <a href="https://swish.swi-prolog.org/p/Ring2.swinb">Ring2</a><br> <br> <b>Deduction Graph proof in cartesian minimal logic</b><br> <a href="https://swish.swi-prolog.org/p/Lawvere.swinb">Lawvere</a><br> <b>Deduction Graph proof in cartesian minimal logic</b><br> Using uncurrying<br> <a href="https://swish.swi-prolog.org/p/Lawvere2.swinb">Lawvere2</a><br> </div> </div>