Hostname: page-component-848d4c4894-tn8tq Total loading time: 0 Render date: 2024-07-03T00:24:38.582Z Has data issue: false hasContentIssue false
  • English
  • Français

Recursive properties of isomorphism types

Published online by Cambridge University Press:  17 April 2009

Michael Moses
Michael Moses
Affiliation:
Department of Mathematics, Western Illinois University, Macomb, Illinois 61455, USA.
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 29 , Issue 3 , June 1984 , pp. 419 - 421
Copyright
Copyright © Australian Mathematical Society 1984

References

[1]Ash, C. and Nerode, A., “Intrinsically recursive relations”, Aspects of effective algebra, 26–41 (Upside Down A Book Co., Steel's Creek, Australia, 1981).Google Scholar
[2]Goncharov, S.S., “Autostability and computable families of constructivizations”, Algebra and Logic 14 (1975), 392–409.Google Scholar
[3]Nurtazin, A., “Strong and weak constructivations and computable families”, Algebra and Logic 13 (1974), 177–184.CrossRefGoogle Scholar