Abstract
In this article, we shall show that the Plotkin-Statman conjecture (Plotkin 1973, Statman 1982) is false. The conjecture was that, in a model of the simply typed λ-calculus with only finitely many elements at each type, definability (by a closed term of the calculus) is decidable. This conjecture had been shown to imply many things, for example, Statman (1982, see also Wolfram 1993) has shown it implies the decidability of pure higher order pattern matching (a problem that remains open at the time of writing) and is equivalent to higher order pattern matching with δ-functions. The proof of undecidability given here uses encodings of semi-Thue systems as definability problems. It had been thought that λ-definability might be characterized by invariance under logical relations, which would imply the Plotkin-Statman conjecture. We give a relatively simple counterexample to this, using our encoding of word problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chellas, B. F. 1980 Modal logic: An introduction, Cambridge University Press, Cambridge, England.
Davis, M. 1977 Unsolvable problems, The handbook of mathematical logic (J. Barwise, editor), North-Holland, Amsterdam.
Jung, A., and J. Tiuryn 1993 A new characterization of lambda definability, Typed lambda calculi and applications, Lecture Notes in Computer Science, vol. 664, Springer-Verlag, Berlin, pp. 245–257.
Plotkin, G. D. 1973 λ-definability and logical relations, University of Edinburgh, School of Artificial Intelligence, Memorandum SAI-RM-4 (October).
Plotkin, G. D. 1980 λ-definability in the full type hierarchy, Combinatory logic, lambda calculus and formalism (J. P. Seldin and J. R. Hindley, editors), Academic Press, New York.
Statman, R. 1982 Completeness, invariance, and A-definability, The Journal of Symbolic Logic, vol. 47, no. 1, pp. 17–26.
Wolfram, D. A. 1993 The clausal theory of types, Cambridge Tracts in Theoretical Computer Science, vol. 21, Cambridge University Press, Cambridge, England.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Loader, R. (2001). The Undecidability of λ-Definability. In: Anderson, C.A., Zelëny, M. (eds) Logic, Meaning and Computation. Synthese Library, vol 305. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0526-5_15
Download citation
DOI: https://doi.org/10.1007/978-94-010-0526-5_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-3891-1
Online ISBN: 978-94-010-0526-5
eBook Packages: Springer Book Archive