Kalmár and Péter: Undecidability as a Consequence of Incompleteness

DOI10.1007/978-3-319-20028-6_35zbMath1461.03006OpenAlexW2286413064MaRDI QIDQ3195713

Máté Szabó

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_35

zbMATH Keywords

undecidabilityincompletenesshistory of computingLászló KalmárPéter Rózsa

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Undecidability and degrees of sets of sentences (03D35) History of mathematical logic and foundations (03-03) Gödel numberings and issues of incompleteness (03F40)

Related Items (1)

Kalmár's Argument Against the Plausibility of Church's Thesis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kalmár and Péter: Undecidability as a Consequence of Incompleteness