Re: Automated higher order logic

Article View: sci.logic

Article #132

#132

From: Sanjeev Mahajan
Date: Tue, 12 Jun 1990 22:34

10 lines
691 bytes

In article <1990Jun7.164927.2631@ulrik.uio.no>, jtl@humanist.uio.no writes:
> 
> 
> Since higher order logic is incomplete, one has of course to give up 
                              ^^^^^^^^^^
By this, I presume you mean that Goedel's completeness theorem and
Compactness theorem do not hold.


Sanjeev

Technical Details

Message-ID: <812@fornax.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!van-bc!ubc-cs!fornax!mahajan

References: <1990Jun7.164927.2631@ulrik.uio.no>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!van-bc!ubc-cs!fornax!mahajan
From: mahajan@fornax.UUCP (Sanjeev Mahajan)
Newsgroups: sci.logic,comp.lang.prolog
Subject: Re: Automated higher order logic
Message-ID: <812@fornax.UUCP>
Date: 12 Jun 90 22:34:50 GMT
References: <1990Jun7.164927.2631@ulrik.uio.no>
Organization: School of Computing Science, SFU, Burnaby, B.C. Canada
Lines: 10

Reply to Parent Message