This is a preview of subscription content, log in via an institution to check access.
Literatur
Church, A.: [1] An unsolvable problem of elementary number theory. Amer. J. Math.58, 345–363 (1936).
Gödel, K.: [1] Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Mh. Math. Phys.38, 173–198 (1931).
Hermes, H.: [1] Zum Begriff der Axiomatisierbarkeit. Math. Nachr.4, 343–347 (1950).
Kleene, S. C.: [1] Recursive predicates and quantifiers. Trans. Amer. Math. Soc.53, 41–73 (1943); [2] Introduction to Metamathematics. Amsterdam 1952; [3] General recursive functions of natural numbers. Math. Ann.112, 727–742 (1936).
Mostowski, A.: [1] On definable sets of positive integers. Fundam. Math.34, 81–112 (1946); [2] On aset of integers not definable by means of onequantifier predicates. Ann. Soc. Polon. Math.21, 114–119 (1948).
Post, E. L.: [1] Recursively enumerable sets of positive integers and their decision problems. Bull. Amer. Math. Soc.50, 284–316 (1944).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Markwald, W. Ein Satz über die Elementar-Arithmetischen Definierbarkeitsklassen. Arch math Logik 2, 78–86 (1956). https://doi.org/10.1007/BF01969993
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01969993