Re: Godel's Incompleteness and Nonmonotonic Logic

From: Herman Jurjus (h.jurjus_at_hetnet.nl)
Date: 08/21/04

  • Next message: Balpreeta Scaramozzi: "Hi" 
    Date: Sat, 21 Aug 2004 11:07:29 +0200

    Student wrote:
    > 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?

    T.McCarthy, Self-Reference and Incompleteness in a Non-Monotonic
    Setting, Journal of Philosophical Logic 23 (1994) 423-449.

    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?

    ...Euh... what makes you think they are so unconcerned?
    Just FYI, especially in NML, metamathematics and computability are much
    discussed, in the past. Answer set programming is an attempt to move
    away from academic discussion into concrete, working systems. That may
    explain the (seeming) lack of attention. 

    -- 
Cheers,
Herman Jurjus
  • Next message: Balpreeta Scaramozzi: "Hi"