 The connection to \(\lambda\)-calculi might suggest—correctly—that CL is sufficiently expressive to formalize recursive functions (i.e., computable functions) and arithmetic. Consequently, CL is susceptible to  Gödel-type incompleteness theorems.