External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition

Giovanni Faglia, Paul Young. In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition. In Georg Gottlob, Alexander Leitsch, Daniele Mundici, editors, Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC 93, Brno, Czech Republic, August 24-27, 1993, Proceedings. Volume 713 of Lecture Notes in Computer Science, pages 187-189, Springer, 1993.

Abstract

Abstract is missing.

runs on