Rekursive Untrennbarkeit Bei Elementaren Theorien

Mathematical Logic Quarterly 17 (1):443-463 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,010

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Rekursive Untrennbarkeit Bei Elementaren Theorien.Hans-Dietrich Hecker - 1971 - Mathematical Logic Quarterly 17 (1):443-463.
Metatheoretische Eigenschaften Gewisser Klassen von Elementaren Theorien.Kurt Hauschild - 1968 - Mathematical Logic Quarterly 14 (13-17):205-244.
Metatheoretische Eigenschaften Gewisser Klassen von Elementaren Theorien.Kurt Hauschild - 1968 - Mathematical Logic Quarterly 14 (13‐17):205-244.
Rekursive Folgenmengen I.Ludwig Staiger & Klaus Wagner - 1978 - Mathematical Logic Quarterly 24 (31-36):523-538.
Rekursive Wortfunktionen.Günter Asser - 1960 - Mathematical Logic Quarterly 6 (15-22):258-278.
Rekursive Folgenmengen I.Ludwig Staiger & Klaus Wagner - 1978 - Mathematical Logic Quarterly 24 (31‐36):523-538.
Rekursive Algebren mit Kettenbedingungen.Walter Baur - 1974 - Mathematical Logic Quarterly 20 (1‐3):37-46.
Rekursive Algebren mit Kettenbedingungen.Walter Baur - 1974 - Mathematical Logic Quarterly 20 (1-3):37-46.
Rekursive Wortfunktionen Über Unendlichen Alphabeten.Frieder Schwenkel - 1965 - Mathematical Logic Quarterly 11 (2):133-147.

Analytics

Added to PP
2013-11-24

Downloads
45 (#493,659)

6 months
6 (#861,180)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Model-theoretic methods in the study of elementary logic.William Hanf - 1965 - Journal of Symbolic Logic 34 (1):132--145.
Decidability and essential undecidability.Hilary Putnam - 1957 - Journal of Symbolic Logic 22 (1):39-54.
Representability of recursively enumerable sets in formal theories.J. C. Shepherdson - 1961 - Archive for Mathematical Logic 5 (3-4):119-127.
Effectively extensible theories.Marian Boykan Pour-El - 1968 - Journal of Symbolic Logic 33 (1):56-68.

Add more references