Abstract
There is a close relationship between the enumerations which admits an abstract structure A and the “effective” computable functions in A, see [1,2,3].
Research partially supported by the Ministry of Culture, Science and Education, Contract # 933, 1988.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y. N. Moschovakis, Abstract computability and invariant definability. J. Symb. Logic. 34:4 (1969).
I. N. Soskov, Definability via enumerations. J. Symb. Logic (to appear).
I. N. Soskov, Computability by means of effectively definable schemes and definability via enumerations, Submitted for publication.
J. C. Shepherdson, Computation over abstract structures, in: “Logic Colloquium’77”, H. E. Rose, J. C. Shepherdson eds., North-Holland, Amsterdam, (1975), pp. 445–513.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Plenum Press, New York
About this chapter
Cite this chapter
Soskova, A.A., Soskov, I.N. (1990). Effective Enumerations of Abstract Structures. In: Petkov, P.P. (eds) Mathematical Logic. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0609-2_26
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0609-2_26
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-7890-0
Online ISBN: 978-1-4613-0609-2
eBook Packages: Springer Book Archive