Skip to main content
SpringerLink
Log in

Algorithmic proof with diminishing resources part 1

  • Conference paper
  • First Online:
Book cover Computer Science Logic (CSL 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 533))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J Hudelmaier,’ Decision Procedure for Propositional N-Prolog', in Extensions of Logic Programming, (Ed) P Schröeder Heister, Springer Verlag 1990.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. D M Gabbay, Labelled Deductive Systems, Oxford University Press, 1992, in preparation.

    Google Scholar 

  4. D M Gabbay, U Reyle, N-Prolog I, Journal of Logic Programming, Vol 1, 1984, pp 319–355.

    Article  Google Scholar 

  5. D M Gabbay, N-Prolog, Part II, Journal of Logic Programming, Vol 2, 1985, pp 251–283.

    Google Scholar 

  6. J-Y Girard, Linear Logic, Theoretical Computer Science 50, 1987, pp 1–102.

    Article  Google Scholar 

  7. D M Gabbay, F Kriwaczek, A family of goal directed theorem provers based on conjunction and implication, to appear in Journal of Automated Reasoning.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College, 180 Queen's Gate, SW7 2BZ, London

    DM Gabbay

Authors
  1. DM Gabbay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter Wolfgang Schönfeld

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation