Undecidability and recursive inseparability

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 4 (7-11):143-147 (1958)
  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,219

External links

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

Through your library

Analytics

Added to PP
2014-01-16

Downloads
54 (#402,626)

6 months
3 (#1,477,354)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Computability, orders, and solvable groups.Arman Darbinyan - 2020 - Journal of Symbolic Logic 85 (4):1588-1598.

Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Undecidable theories.Alfred Tarski - 1968 - Amsterdam,: North-Holland Pub. Co.. Edited by Andrzej Mostowski & Raphael M. Robinson.
Languages in which self reference is possible.Raymond M. Smullyan - 1957 - Journal of Symbolic Logic 22 (1):55-67.
Decidability and essential undecidability.Hilary Putnam - 1957 - Journal of Symbolic Logic 22 (1):39-54.
Review: Alfred Tarski, Undecidable Theories. [REVIEW]Martin Davis - 1959 - Journal of Symbolic Logic 24 (2):167-169.

View all 6 references / Add more references