Re: FOL, ZFC, NGB and Prolog

From: "Tom" <tkorna@xxxxx>
Date: 7 Jun 2005 10:00:58 -0700

Jim Spriggs wrote:
> Tom wrote:
> >
> > .... Prolog is,
> > merely, FOL in executable notation.
>

: No, Prolog is much more restrictive than FOL.

I see. I thought that it is, as is FOL, Turing complete.

Kindest regards,
Tom

.

Follow-Ups:
- Re: FOL, ZFC, NGB and Prolog
  - From: Jim Spriggs
- Re: FOL, ZFC, NGB and Prolog
  - From: Barb Knox

References:
- FOL, ZFC, NGB and Prolog
  - From: Tom
- Re: FOL, ZFC, NGB and Prolog
  - From: Jim Spriggs

Prev by Date: Boolean expression sought for
Next by Date: Re: Farewell to FOL - The relativity of mathematics truth in general.
Previous by thread: Re: FOL, ZFC, NGB and Prolog
Next by thread: Re: FOL, ZFC, NGB and Prolog
Index(es):
- Date
- Thread

Relevant Pages

Re: FOL, ZFC, NGB and Prolog
... >> Tom wrote: ... >>> merely, FOL in executable notation. ... Prolog is much more restrictive than FOL. ...
(sci.logic)
Re: FOL, ZFC, NGB and Prolog
... >> Tom wrote: ... Prolog is much more restrictive than FOL. ... Prolog, like all reasonable programming languages, is Turing complete. ...
(sci.logic)
Re: FOL, ZFC, NGB and Prolog
... > merely, FOL in executable notation. ... Prolog is much more restrictive than FOL. ... Prev by Date: ...
(sci.logic)
Re: predicate in a predicate
... Prolog is somehow from Horn Clauses, they can have at most one ... how can I convert the FOL that have two positive ... With negation as failure you can go beyond horn clauses. ...
(sci.logic)
Re: predicate in a predicate
... Prolog is somehow from Horn Clauses, they can have at most one ... how can I convert the FOL that have two positive ... With negation as failure you can go beyond horn clauses. ... positivity check is ok, so this amounts to prolog as: ...
(sci.logic)