Arithmetic Formulated in a Logic of Meaning Containment
We assess Meyer’s formalization of arithmetic in his , based on the strong relevant logic R and compare this with arithmetic based on a suitable logic of meaning containment, which was developed in Brady . We argue in favour of the latter as it better captures the key logical concepts of meaning and truth in arithmetic. We also contrast the two approaches to classical recapture, again favouring our approach in . We then consider our previous development of Peano arithmetic including primitive recursive functions, finally extending this work to that of general recursion.