A Structural Account of Combinatory Completeness
arXiv:2511.17152
Abstract
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Moreover, we characterise combinatory completeness of a given applicative system in terms of multicategory structure on its computable maps.
31 pages, journal version of https://doi.org/10.1007/978-3-032-22469-9_16. In peer review