Decidable classes of recursive equations
Many different formalisations of recursive arithmetic have been proposed, and this thesis is concerned mainly with the system proposed by R.L. Goodstein and known as the Axiom - Free Equation Calculus. As with all other formal systems of arithmetic with sufficient content, the system is incomplete a...
| Main Author: | |
|---|---|
| Published: |
University of Leicester
1969
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.737123 |