Logic in Computer Science (LICS 1988)

Paper: Proving unprovability (at LICS 1988)

Authors: Michael L. Tiomkin

Abstract

A formal proof system for unprovability in the predicate calculi is developed. This system is shown to be complete with respect to the logic of finite structures. It can be used to extend the `negation by failure' of Prolog, prevent infinite loops in a deductive data base or Prolog, or prove formulaes in nonmonotonic (default) logic

BibTeX

  @InProceedings{Tiomkin-Provingunprovabilit,
    author = 	 {Michael L. Tiomkin},
    title = 	 {Proving unprovability},
    booktitle =  {Proceedings of the Third Annual IEEE Symp. on Logic in Computer Science, {LICS} 1988},
    year =	 1988,
    editor =	 {Yuri Gurevich},
    month =	 {July}, 
    pages =      {22--26},
    location =   {Edinburgh, Scotland, UK}, 
    publisher =	 {IEEE Computer Society Press}
  }