The Undecidability of λK-Conversion

Haskell B. Curry

A chapter in Foundations of Mathematics, 1969, pp 10-14 from Springer

Abstract: Abstract In 1936 Church 1 proved that two fundamental questions of the theory of λ-conversion2 were recursively undecidable. The first question was whether two obs (well-formed formulas) of the system are equal (convertible); the second was whether or not an ob X has a normal form. The purpose of this note is to give a new proof of an analogous result for λK-conversion. This proof was obtained in the course of preparing the second volume of [5].

Keywords: Normal Form; Recursive Function; Combinatory Logic; Replacement Rule; Preliminary Explanation (search for similar items in EconPapers)
Date: 1969
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-86745-3_2

Ordering information: This item can be ordered from
http://www.springer.com/9783642867453

DOI: 10.1007/978-3-642-86745-3_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().