Skip to main content

Some Tweets About Mockingbirds

  • Chapter
  • First Online:
Book cover Raymond Smullyan on Self Reference

Part of the book series: Outstanding Contributions to Logic ((OCTR,volume 14))

Abstract

In his fascinating book “To Mock a Mockingbird”, Ray Smullyan asks whether a fixed point combinator can be constructed from the Bluebird B, the Identity Bird I, and the Mockingbird M (sometimes called “little omega”). This is still not known.The mockingbird is only a special kind of mimid. Mimids are those birds which upon hearing the name of x, say what x would say upon hearing the name of some other y. In this note we shall characterize the set of mimids that occur in the Bluebird/Mockingbird flock.

For Ray Smullyan:

Hush, little baby, don’t say a word,

Raymond’s gonna buy you a mockingbird.

If that mockingbird won’t mock,

Raymond’s gonna buy you some Google stock!

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

Access this chapter

Institutional subscriptions

References

  • Barendregt, H. (1983). The lambda calculus. Amsterdam: North Holland.

    Google Scholar 

  • Church, A. (1941). The calculi of lambda conversion. Princeton: Princeton University Press.

    Google Scholar 

  • Curry, H. B. (1958). Combinatory logic (Vol. 1). Amsterdam: North Holland.

    Google Scholar 

  • Smullyan, R. (1985). To mock a Mockingbird. New York: Knopf.

    Google Scholar 

  • Statman, R. (1986). On translating lambda terms into combinators. In Proceedings of the Logic in Computer Science Conference I.E.E.E.

    Google Scholar 

  • Statman, R. (1991). Freyd’s hierarchy of combinator monoids. In Proceedings of the Logic in Computer Science Conference I.E.E.E.

    Google Scholar 

  • Statman, R. (1993). Some examples of non-existant combinators. Theoretical Computer Science, 121, 441–448.

    Article  Google Scholar 

  • Statman, R. (2014). Near semi-rings and lambda calculus, 12th International Conference on Typed Lambda Calculus and Applications, July 14–17, 2014. Vienna Austria (to appear in Lecture Notes in Computer Science).

    Google Scholar 

  • Wos, L., & McCune, W. (1996). The absence and presence of fixed point combinators. Automated Deduction - CADE-13 Lecture Notes in Computer Science. p. 1194.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rick Statman .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Statman, R. (2017). Some Tweets About Mockingbirds. In: Fitting, M., Rayman, B. (eds) Raymond Smullyan on Self Reference. Outstanding Contributions to Logic, vol 14. Springer, Cham. https://doi.org/10.1007/978-3-319-68732-2_6

Download citation

Publish with us

Policies and ethics