Answers are grounded in this paper and cite their sources.
A $BCK(p)$-term is a closed lambda-term in which each abstraction binds at most p variables; for $p=1$ these terms are related to the axiom system BCK of combinatory logic. We determine the number of $BCK(p)$-terms of size n, up to a constant multiplicative factor, for every p≥2. For $p=2$ the result is fully explicit: \[ f_n~ A\,n2n/52n/5e-2n/5n-3/5e^{P(n1/5)}, \] where P is an explicit polynomial of degree $4$. In general the asymptotic formula involves npn/(2p+1) and an exponential of a polynomial in n1/(2p+1). The proof combines a linearization of the defining functional equation, the analysis of the Borel transform of the linearized generating function, which satisfies a linear differential equation with an irregular singularity at infinity, the saddle point method for Hayman-admissible functions, and positivity arguments comparing the original and the linearized sequences. For $p=1$ this comparison fails: the quadratic term then also changes the polynomial factor.
No takes yet. Share an insight, caveat, or question.
Olivier Bodini (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: