A conjecture on numeral systems
| dc.creator | Nour, Karim | |
| dc.date | 2009-05-06 | |
| dc.date.accessioned | 2026-07-07T13:12:11Z | |
| dc.date.available | 2026-07-07T13:12:11Z | |
| dc.description | A numeral system is an infinite sequence of different closed normal $λ$-terms intended to code the integers in $λ$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor, Predecessor, and Zero Test, then all total recursive functions can be represented. In this paper we prove the independancy of these particular three functions. We give at the end a conjecture on the number of unary functions necessary to represent all total recursive functions. | |
| dc.identifier | https://arxiv.org/abs/0905.0755 | |
| dc.identifier | http://arxiv.org/abs/0905.0755 | |
| dc.identifier | Notre Dame Journal of Formal Logic 38 (1997) 270-275 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/229511 | |
| dc.subject | Logic | |
| dc.title | A conjecture on numeral systems | |
| dc.type | text |