A Proof-Theoretic Analysis of Goal-Directed Provability

A Proof-Theoretic Analysis of Goal-Directed Provability (1992)

Cached

Download Links

[www.cs.rmit.edu.au]
[www.cs.rmit.edu.au]

Other Repositories/Bibliography

DBLP

by James Harland

Venue:	Journal of Logic and Computation
Citations:	14 - 8 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Proof-Theoretic Analysis of Goal-Directed Provability	user correction - Legacy Corrections
AUTHOR NAME	James Harland	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, University of Melbourne; Parkville, 3052, Victoria	SVM HeaderParse 0.2
AUTHOR ADDR	Australia	SVM HeaderParse 0.1
ABSTRACT	One of the distinguishing features of logic programming seems to be the notion of goal-directed provability, i.e. that the structure of the goal is used to determine the next step in the proof search process. It is known that by restricting the class of formulae it is possible to guarantee that a certain class of proofs, known as uniform proofs, are complete with respect to provability in intuitionistic logic. In this paper we explore the relationship between uniform proofs and classes of formulae more deeply. Firstly we show that uniform proofs arise naturally as a normal form for proofs in first-order intuitionistic sequent calculus. Next we show that the class of formulae known as hereditary Harrop formulae are intimately related to uniform proofs, and that we may extract such formulae from uniform proofs in two different ways. We also give results which may be interpreted as showing that hereditary Harrop formulae are the largest class of formulae for which uniform proo...	user correction - Legacy Corrections
YEAR	1992	user correction - Legacy Corrections
VENUE	Journal of Logic and Computation	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	4--1	INFERENCE
VOLUME	4	INFERENCE
CITATIONS	20 found	ParsCit 1.0