Skip to main content
SpringerLink
Log in

Some undecidable theories with monadic predicates and without equality

  • Published:
Archiv für mathematische Logik und Grundlagenforschung 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. Börger, E., Kleine Büning, H.: The reachability problem for Petri nets and decision problems for Skolem arithmetic. Tagungsband: Mathematische Logik, Oberwolfach, April 1978.

    Google Scholar 

  2. Garfunkel, S., Schmerl, S.H.: The undecidability of theories of groupoids with an extra predicate. Proc. Am. Math. Soc.42, 286–289 (1974).

    Google Scholar 

  3. Minsky, M.: Recursive unsolvability of post problem of “Tag” and other topics in the theory of turning machines. Ann. Math.74, 437–455 (1961).

    Google Scholar 

  4. Shepherdson, S.C., Sturgis, H.E.: Computability of recursive functions. ACM10, 217–255 (1963).

    Google Scholar 

  5. Shoenfield, J.R.: Mathematical logic. Reading (Mass.): Addison-Wesley 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für mathematische Logik und Grundlagenforschung, Universität Münster, Roxeler Str. 64, D-4400, Münster, Federal Republic of Germany

    Hans Kleine Büning

Authors
  1. Hans Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Büning, H.K. Some undecidable theories with monadic predicates and without equality. Arch math Logik 21, 137–148 (1981). https://doi.org/10.1007/BF02011640

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation