Godel's Incompleteness and Nonmonotonic Logic

From: Student (hgtohybtml_at_mailinator.com)
Date: 08/20/04

  • Next message: barry2: "Re: newbie list question" 
    Date: 20 Aug 2004 12:24:58 -0700

    I have recently read a few papers, web pages, and parts of a text on
    nonmonotonic logic, Answer Set programming, and AnsProlog in
    particular. I find it interesting that nobody addresses the issue of
    Godel's incompleteness theorems because these "logics" force
    completeness by making any formula "A" or its negation "not A"
    provable. Does anybody have any information, links, references,
    comments on this topic? In most other aspects of computer science, it
    would be considered foolish to dismiss metamathematics issues
    (decidability, etc)... so why are modern logicians unconcerned about
    consistency and soundness of their logical system?

  • Next message: barry2: "Re: newbie list question"