×

Zur Axiomatisierbarkeit von Theorien in der schwachen Logik der zweiten Stufe. (German) Zbl 0165.01501


References:

[1] W. Craig, On axiomatizability within a system. J. Symbolic Logic18 (1953), 30–32. · Zbl 0053.20101 · doi:10.2307/2266324
[2] W. Craig u. R. L. Vaught, Finite axiomatizability using additional predicates. J. Symbolic Logic23 (1958), 289–308. · Zbl 0085.24601 · doi:10.2307/2964289
[3] K. Härtig, Explizite Definitionen einiger Eigenschaften von Zeichenreihen. Z. Math. Logik u. Grundlagen Math.2 (1956), 177–203. · Zbl 0075.23201 · doi:10.1002/malq.19560021005
[4] –, Einbettung elementarer Theorien in endlich axiomatisierbare. Z. Math. Logik u. Grundlagen Math.4 (1958), 249–292. · Zbl 0099.00902 · doi:10.1002/malq.19580041702
[5] H. Hermes, Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit. Berlin, Göttingen u. Heidelberg, 1961.
[6] -, Einführung in die mathematische Logik. Stuttgart, 1963. · Zbl 0115.00503
[7] S. C. Kleene, Introduction to metamathematics. Amsterdam u. Groningen, 1952. · Zbl 0047.00703
[8] –, Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Mem. Amer. Math. Soc.10 (1952), 27–68. · Zbl 0047.25001
[9] A. Mostowski, Concerning the problem of axiomatizability of the field of real numbers in the weak second order logic. Essays on the foundations of mathematics, Jerusalem, 1961, S. 269–286.
[10] R. Péter, Rekursive Funktionen. 2. Aufl., Budapest, 1957.
[11] A. Tarski, Some model-theoretical results concerning weak second order logic. Notices Amer. Math. Soc.5 (1958), S. 673.
[12] A. Tarski, A. Mostowski u. R. M. Robinson, Undecidable theories. Amsterdam, 1953. · Zbl 0053.00401
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.