Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
INTRIGILA, BENEDETTO
and
STATMAN, RICHARD
2017.
Lambda theories allowing terms with a finite number of fixed points.
Mathematical Structures in Computer Science,
Vol. 27,
Issue. 3,
p.
405.
Manzonetto, Giulio
Polonsky, Andrew
Saurin, Alexis
and
Simonsen, Jakob Grue
2019.
The fixed point property and a technique to harness double fixed point combinators.
Journal of Logic and Computation,
Vol. 29,
Issue. 5,
p.
831.

, the untyped λ-calculus in which all unsolvables are identified. We resolve a conjecture of Barendregt asserting that the range of a definable map is either infinite or a singleton. This is refuted by constructing a λ-term Ξ such that ΞM = ΞI ⇔ ΞM ≠ ΞΩ. The construction generalizes to ranges of any finite size, and to some other sensible lambda theories.