Abstract
We present goal directed computation prcedures for classical, intuitionistic and linear implication. The procedure allows for using assumptions at most once. Completeness is proved and proof theoretic results such as interpolation are indicated
I am grateful to J Hudelmaier for critical comments. See his paper for similar results in connection with N-Prolog. I also benefitted from a discussion with Roy Dyckhoff
Preview
Unable to display preview. Download preview PDF.
References
J Hudelmaier,’ Decision Procedure for Propositional N-Prolog', in Extensions of Logic Programming, (Ed) P Schröeder Heister, Springer Verlag 1990.
D M Gabbay, Theory of Algorithmic Proof, A chapter in Handbook of Logic in Theoretical Computer Science, Volume 1, S Abramsky, D M Gabbay and T S E Maibaum (Eds), Oxford University Press, to appear.
D M Gabbay, Labelled Deductive Systems, Oxford University Press, 1992, in preparation.
D M Gabbay, U Reyle, N-Prolog I, Journal of Logic Programming, Vol 1, 1984, pp 319–355.
D M Gabbay, N-Prolog, Part II, Journal of Logic Programming, Vol 2, 1985, pp 251–283.
J-Y Girard, Linear Logic, Theoretical Computer Science 50, 1987, pp 1–102.
D M Gabbay, F Kriwaczek, A family of goal directed theorem provers based on conjunction and implication, to appear in Journal of Automated Reasoning.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabbay, D. (1991). Algorithmic proof with diminishing resources part 1. In: Börger, E., Kleine Büning, H., Richter, M.M., Schönfeld, W. (eds) Computer Science Logic. CSL 1990. Lecture Notes in Computer Science, vol 533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54487-9_58
Download citation
DOI: https://doi.org/10.1007/3-540-54487-9_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54487-6
Online ISBN: 978-3-540-38401-4
eBook Packages: Springer Book Archive