Algorithmic properties of structures. (English) Zbl 0202.00802

Full Text: DOI


[1] S. C. Kleene. Representation of events in nerve nets and finite automata.Automata Studies, pp. 3–41, Princeton, 1956.
[2] S. C. Kleene andR. E. Vesley.The Foundations of Intuitionistic Mathematics. North Holland Publishing Company, Amsterdam, 1965. · Zbl 0133.24601
[3] G. Kreisel. Recursive, Subrecursive, Metarecursive. To appear in the proceedings of the 1965 Symposium on Logic, Computability and Automata, Oriskany, N. Y.
[4] G. Kreisel. Mathematical logic. In:Lectures on Modern Mathematics (ed. Saaty), vol. 3, Wiley, New York, 1965. · Zbl 0147.24703
[5] A. I. Malcev. Constructive algebras. I.Russian Math. Surveys 16 (1961), 77–129. · Zbl 0129.25903 · doi:10.1070/RM1961v016n03ABEH001120
[6] 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. · Zbl 0105.00802 · doi:10.2307/1970290
[7] M. O. Rabin. Computable algebras, general theory and theory of computable fields.Trans. Amer. Math. Soc. 95 (1960), 341–360. · Zbl 0156.01201
[8] D. S. Scott. Some definitional suggestions for automata theory. Mimeographed notes, Stanford, 1966. · Zbl 0164.32103
[9] J. C. Shepherdson andH. E. Sturgis. Computability of recursive functions.J. Assoc. Comput. Mach. 10 (1963), 217–255. · Zbl 0118.25401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.