METAMATHEMATICAL LIMITS TO COMPUTATION
DOI10.1142/9789814329484_0005zbMath1348.03015OpenAlexW2477420159MaRDI QIDQ2829934
Francisco Antonio Doria, Newton C. A. Da Costa
Publication date: 9 November 2016
Published in: The Handbook on Reasoning-Based Intelligent Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/9789814329484_0005
Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Foundations of classical theories (including reverse mathematics) (03B30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Gödel numberings and issues of incompleteness (03F40)
This page was built for publication: METAMATHEMATICAL LIMITS TO COMPUTATION