The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Uniform Provability in Classical Logic
[article]
1998
arXiv
pre-print
Uniform proofs are sequent calculus proofs with the following characteristic: the last step in the derivation of a complex formula at any stage in the proof is always the introduction of the top-level logical symbol of that formula. We investigate the relevance of this uniform proof notion to structuring proof search in classical logic. A logical language in whose context provability is equivalent to uniform provability admits of a goal-directed proof procedure that interprets logical symbols
arXiv:cs/9809014v1
fatcat:vqmbhrpjqrhhjjodqm3i2hru2m