Kalmar and Peter: Undecidability as a Consequence of Incompleteness

TitleKalmar and Peter: Undecidability as a Consequence of Incompleteness
Publication TypeConference Proceedings
Year of Conference2015
AuthorsSzabo, M
Conference NameComputability in Europe
VolumeBeckmann, Mitrana, and Soskova (eds) - Evolving Computability, 11th Conference of CiE, Bucharest, 2015
Pagination343-352
Date Published08/2015
PublisherSpringer
Abstract

Laszlo Kalmar and Peter Rozsa "proved that the existence of absolutely undecidable problems follows from Gödel's Theorem on relatively undecidable problems'' (Péter 1976, p. vii). Unfortunately,
the only available document of their joint work is Kalmár's sketch of the proof in his (1949). In the following I assemble a paper from Kalmár's manuscripts on this issue.

URLhttp://www.springer.com/in/book/9783319200279#