Skip to main content
SpringerLink
Log in

Algorithmic properties of structures

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  5. A. I. Malcev. Constructive algebras. I.Russian Math. Surveys 16 (1961), 77–129.

    Google Scholar 

  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.

    Google Scholar 

  7. M. O. Rabin. Computable algebras, general theory and theory of computable fields.Trans. Amer. Math. Soc. 95 (1960), 341–360.

    Google Scholar 

  8. D. S. Scott. Some definitional suggestions for automata theory. Mimeographed notes, Stanford, 1966.

  9. J. C. Shepherdson andH. E. Sturgis. Computability of recursive functions.J. Assoc. Comput. Mach. 10 (1963), 217–255.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Minnesota, USA

    Erwin Engeler

Authors
  1. Erwin Engeler
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partially supported by NSF Grant GP 5434.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01705528

Keywords

Search

Navigation