 The abbreviations and the interspersed explanations in the sketch above may obscure that arithmetic has been formalized in a language that consists of five symbols (when juxtaposition is not counted): \(\textsf{S}\),  \(\textsf{K}\), \(=\) plus two delimiters, \(\,(\,\) and  \(\,)\,\). The finite (and perhaps, surprisingly small) number of symbols and the availability of recursive functions conjure the thought that an arithmetization of the syntax of CL could be attempted.