Computability

DOI10.1007/978-3-030-83202-5OpenAlexW4289536253MaRDI QIDQ5153715

George Tourlakis

Publication date: 30 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-83202-5

zbMATH Keywords

complexityChurch's thesisreducibilitypropositional logicset theoryrecursive functionsunsolvabilityrecursivenessGödel's incompleteness theoremsarithmetizationrecursion theoremsrelativized computabilityeffective enumerabilitysemi-recursiveness

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical propositional logic (03B05) Gödel numberings and issues of incompleteness (03F40) Computability and recursion theory (03Dxx)

This page was built for publication: Computability