References
S. C. Kleene. Representation of events in nerve nets and finite automata.Automata Studies, pp. 3–41, Princeton, 1956.
S. C. Kleene andR. E. Vesley.The Foundations of Intuitionistic Mathematics. North Holland Publishing Company, Amsterdam, 1965.
G. Kreisel. Recursive, Subrecursive, Metarecursive. To appear in the proceedings of the 1965 Symposium on Logic, Computability and Automata, Oriskany, N. Y.
G. Kreisel. Mathematical logic. In:Lectures on Modern Mathematics (ed. Saaty), vol. 3, Wiley, New York, 1965.
A. I. Malcev. Constructive algebras. I.Russian Math. Surveys 16 (1961), 77–129.
M. L. Minsky. Recursive unsolvability of Post's problem of “tag” and other topics in the theory of Turing machines.Ann. of Math. 74 (1961), 437–455.
M. O. Rabin. Computable algebras, general theory and theory of computable fields.Trans. Amer. Math. Soc. 95 (1960), 341–360.
D. S. Scott. Some definitional suggestions for automata theory. Mimeographed notes, Stanford, 1966.
J. C. Shepherdson andH. E. Sturgis. Computability of recursive functions.J. Assoc. Comput. Mach. 10 (1963), 217–255.
Author information
Authors and Affiliations
Additional information
Research partially supported by NSF Grant GP 5434.
Rights and permissions
About this article
Cite this article
Engeler, E. Algorithmic properties of structures. Math. Systems Theory 1, 183–195 (1967). https://doi.org/10.1007/BF01705528
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01705528