A conjecture on numeral systems (Q1381438): Difference between revisions

A numeral system is defined, in this paper, as any infinite sequence of different, closed normal \(\lambda\)-terms. These can then encode the integers in \(\lambda\)-calculus. Barendregt has shown that if, for a numeral system, the successor, predecessor and zero test functions can be represented then so can all total recursive functions. In this interesting paper the author shows that there are numeral systems with any two but not all three of these functions and conjectures that there are no two unary functions in terms of which all total recursive functions can be defined for an arbitrary numeral system.