[FOM] Alternative foundations?

Rob Arthan rda at lemma-one.com
Tue Feb 25 14:44:42 EST 2014

On 24 Feb 2014, at 02:28, Christopher Menzel wrote:

> On Feb 22, 2014, at 5:51 AM, Josef Urban <josef.urban at gmail.com> wrote:
>> Isn't Prolog an example how bare classical first-order logic computes?
> Negation isn’t classical in Prolog. Typically it uses some form of negation as failure, which is non-monotonic.

Pure Prolog is Turing-complete.


-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20140225/c328c610/attachment-0001.html>

More information about the FOM mailing list