| Deutsch English Français Italiano |
|
<vjl5va$sks9$2@solani.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder8.news.weretis.net!reader5.news.weretis.net!news.solani.org!.POSTED!not-for-mail From: Mild Shock <janburse@fastmail.fm> Newsgroups: sci.math Subject: Advent of Logic 2024: Weekend 2 (Was: Advent of Logic 2024: Weekend 1) Date: Sun, 15 Dec 2024 00:56:26 +0100 Message-ID: <vjl5va$sks9$2@solani.org> References: <vjl5u1$sks9$1@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 23:56:26 -0000 (UTC) Injection-Info: solani.org; logging-data="938889"; 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:9JXcki/WjN429jmatQqMopupFwI= X-User-ID: eJwFwYEBwCAIA7CXwNIi5yjD/09YQsjVGaKCj0+3PNOJWLd3f8O62BT28jWcbODJ0kszB2YqPjt7oXE77ActIBR0 In-Reply-To: <vjl5u1$sks9$1@solani.org> Bytes: 1549 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