Talk:Closed lambda term

Open question. What is the smallest complete closed λ-term in terms of Fokker size? It is at least three and at most seven.

Why three is the low boundary and not four? It's known that complete basis must include a combinator of rank 3. It's also known that complete basis must include duplicative combinator (i.e. a combinator with at least one application inside). 3 abstractions plus 1 application = Fokker size is at least 4, isn't it? --Blashyrkh (talk) 10:14, 16 January 2026 (UTC)

Your reasoning is solid. I was writing conservatively but I think that you are correct. Let me think over it a bit more before I edit the page. Thanks for pointing this out! Corbin (talk) 17:51, 16 January 2026 (UTC)

If you find me wrong, please let me know. I'm really curious to see a counter-example. --Blashyrkh (talk) 18:02, 16 January 2026 (UTC)