Skip to main content
SpringerLink
Log in

A simple proof of the genericity lemma

  • Chapter
  • First Online:
Book cover Logic, Language and Computation

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

Abstract

A short direct proof is given for the fundamental property of unsolvable λ-terms; if M is an unsolvable λ-term and C[M] is solvable, then C[N] is solvable for any λ-term N. (Here C[ ] stands for an arbitrary context.)

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

Reference

  1. H. P. Barendregt, The Lambda Calculus (North-Holland 1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, Tokyo Institute of Technology, Ookayama, Meguro, 152, Tokyo, Japan

    Masako Takahashi

Authors
  1. Masako Takahashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Neil D. Jones Masami Hagiya Masahiko Sato

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Takahashi, M. (1994). A simple proof of the genericity lemma. In: Jones, N.D., Hagiya, M., Sato, M. (eds) Logic, Language and Computation. Lecture Notes in Computer Science, vol 792. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032397

Download citation

  • DOI: https://doi.org/10.1007/BFb0032397

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57935-9

  • Online ISBN: 978-3-540-48391-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation