Theorem Proving via Uniform Proofs>

Abstract
Uniform proofs systems have recently been proposed [Mi191j as a proof-theoretic foundation and generalization of logic programming. In [Mom92a] an extension with constructive negation is presented preserving the nature of abstract logic programming language. Here we adapt this approach to provide a complete theorem proving technique for minimal, intuitionistic and classical logic, which is totally goal-oriented and does not require any form of ancestry resolution. The key idea is to use the Godel-Gentzen translation to embed those logics in the syntax of Hereditary Harrop formulae, for which uniform proofs are complete. We discuss some preliminary implementation issues.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,248
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
On Automating Diagrammatic Proofs of Arithmetic Arguments.Mateja Jamnik, Alan Bundy & Ian Green - 1999 - Journal of Logic, Language and Information 8 (3):297-321.
More About Uniform Upper Bounds on Ideals of Turing Degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
A Compact Representation of Proofs.Dale A. Miller - 1987 - Studia Logica 46 (4):347 - 370.
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic.Takahito Aoto - 1999 - Journal of Logic, Language and Information 8 (2):217-242.
Proofs of the Compactness Theorem.Alexander Paseau - 2010 - History and Philosophy of Logic 31 (1):73-98.
Added to PP index
2010-12-22

Total downloads
7 ( #534,714 of 2,192,159 )

Recent downloads (6 months)
1 ( #289,804 of 2,192,159 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature