Skip to main content

Lambda Logic

  • Conference paper
Automated Reasoning (IJCAR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3097))

Included in the following conference series:

Abstract

Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions of lambda logic. We use lambda logic to state and prove a soundness theorem allowing the use of second order unification in resolution, demodulation, and paramodulation in a first-order context.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics, October 1984. Studies in Logic and the Foundations of Mathematics, vol. 103. Elsevier Science Ltd, Amsterdam (1984) (revised edition)

    MATH  Google Scholar 

  2. Barendregt, H., Bunder, M., Dekkers, W.: Completeness of two systems of illative combinatory logic for first order propositional and predicate calculus. Archive für Mathematische Logik 37, 327–341 (1998)

    MATH  MathSciNet  Google Scholar 

  3. Beeson, M.: Foundations of Constructive Mathematics. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  4. Beeson, M.: Proving programs and programming proofs. In: Barcan, Marcus, Dorn, Weingartner (eds.) Proceedings of the International Congress Logic, Methodology, and Philosophy of Science VII, Salzburg, 1983, pp. 51–81. North-Holland, Amsterdam (1986)

    Chapter  Google Scholar 

  5. Beeson, M.: Otter Two System Description. In: IJCAR 2004 (2004) (submitted)

    Google Scholar 

  6. Feferman, S.: Constructive theories of functions and classes. In: Boffa, M., van Dalen, D., McAloon, K. (eds.) Proceedings of the Logic Colloquium at Mons Logic Colloquium 1978, pp. 159–224. North-Holland, Amsterdam (1979)

    Chapter  Google Scholar 

  7. Moggi, E.: The Partial Lambda-Calculus. PhD thesis, University of Edinburgh (1988), http://citeseer.nj.nec.com/moggi88partial.html

  8. Scott, D.: Identity and existence in intuitionistic logic. In: Fourman, M.P., Mulvey, C.J., Scott, D.S. (eds.) Applications of Sheaves. Lecture Notes in Mathematics, vol. 753, pp. 660–696. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  9. Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, Reading (1967)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beeson, M. (2004). Lambda Logic. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25984-8_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22345-0

  • Online ISBN: 978-3-540-25984-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics