Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.674074
Title: Parameter reduction in definition by multi-successor recursion
Author: Burville, J. C.
Awarding Body: University of Leicester
Current Institution: University of Leicester
Date of Award: 1973
Availability of Full Text:
Access through EThOS:
Access through Institution:
Abstract:
It is well known that in primitive recursive arithmetic with a single successor the number of parameters in a definition by recursion may be successively reduced. In this thesis I examine the possibility of effecting a similar reduction in the number of parameters in a definition by recursion in a multi-successor arithmetic. The reduction process involves the discovery in multi-successor arithmetic of analogues of pairing functions and of functions which select the elements of an ordered pair. One of the difficulties in finding such functions is the construction within multi-successor arithmetic of suitable product and square foot functions and establishing the properties of these functions, and the pairing functions, within a formalisation of multi-successor arithmetic. The reduction process involves of course an examination of what functions, if any, need to be adjoined to the initial functions to secure the generality of the reduction.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.674074  DOI: Not available
Share: