Prolog & Incompleteness

From: Jurgen Van Gael (jurgen.vangael_at_student.kuleuven.ac.be)
Date: 03/13/04

  • Next message: Yupar Nyo: "removing the largest item from the list" 
    Date: Sat, 13 Mar 2004 14:59:02 +0100

    Hi,

    I have just started a prolog programming course this semester and this is
    something which has been on my mind lately. Prolog tries to prove first
    order predicate logic theorems given certain inference steps. As prolog
    allows arithmetic it seems as if prolog logic has all necessary ingredients
    to be subject to godel's incompleteness theorem. My question is if there
    indeed are truths which prolog will never be able to prove or if certain
    builtin assumptions (closed world, ...) free prolog of being incomplete.

    looking forward for your replies,

    Jurgen

  • Next message: Yupar Nyo: "removing the largest item from the list"