| Deutsch English Français Italiano |
|
<vjl14h$siot$1@solani.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.roellig-ltd.de!open-news-network.org!weretis.net!feeder8.news.weretis.net!reader5.news.weretis.net!news.solani.org!.POSTED!not-for-mail From: Mild Shock <janburse@fastmail.fm> Newsgroups: comp.lang.prolog Subject: Advent of Logic 2024: Weekend 2 (Was: Advent of Logic 2024: Weekend 1) Date: Sat, 14 Dec 2024 23:33:54 +0100 Message-ID: <vjl14h$siot$1@solani.org> References: <vjksgj$sgo6$3@solani.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Sat, 14 Dec 2024 22:33:53 -0000 (UTC) Injection-Info: solani.org; logging-data="936733"; mail-complaints-to="abuse@news.solani.org" User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Firefox/91.0 SeaMonkey/2.53.19 Cancel-Lock: sha1:LqNh15cCcB50X6Tn5VsskfnVIg0= X-User-ID: eJwFwQkBwDAIA0BLlBDo5PAU/xJ2R/jxDnO6cbmhR5S0Y7bEXtG1SxDVLeJVuivZOYlv4immBxzXp0WG/S0CFRo= In-Reply-To: <vjksgj$sgo6$3@solani.org> Bytes: 1599 Lines: 24 Hi, Create a proof search in Combinatory Logic, that finds a Combinator Expression as proof for a given formula in propositional logic. The propositional logic can do with implication only, and it should be Linear Logic. French logician Jean-Yves Girard is credited with Linear Logic, and since we have implication logic only, the Logic will be also affine, i.e. it will have no contraction, which makes it special towards certain paradoxes. Bye Mild Shock schrieb: > Hi, > > Draw a Colored ASCII Christams tree with Prolog. > > Bye