Hostname: page-component-745bb68f8f-g4j75 Total loading time: 0 Render date: 2025-01-11T21:02:46.909Z Has data issue: false hasContentIssue false
  • English
  • Français

On n-adic representation of numbers1

Published online by Cambridge University Press:  12 March 2014

Thomas E. Patton
Thomas E. Patton*
Affiliation:
The University of Pennsylvania
Get access Rights & Permissions [Opens in a new window]

Extract

In Smullyan [1], where recursive enumerability is defined in terms of elementary dyadic arithmetics (dyadic EA's), it is shown that for any number n, the parallel definition in terms of n-adic EA′s is equivalent. This proof at one stage uses the deep result of Godei that plus and times form a sub-basis for the recursively enumerable attributes (sets and relations)2. The aim of this note is to prove this equivalence in more pedestrian fashion.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 28 , Issue 2 , June 1963 , pp. 161 - 163
Copyright
Copyright © Association for Symbolic Logic 1964

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

I am indebted to the referee, who suggested using a construction from Smullyan [2] that made my proof shorter and more elegant.

References

[1]Smullyan, R. M., Theory of formal systems, Annals of mathematics studies, no. 47 (1961).CrossRefGoogle Scholar
[2]Smullyan, R. M., Extended canonical systems, Proceedings of the American Mathematicae Society, vol. 12 (1961).Google Scholar