Metamathematical limits to computation

DOI10.1142/9789814329484_0005zbMATH Open1348.03015OpenAlexW2477420159MaRDI QIDQ2829934FDOQ2829934

Authors: Francisco Antonio Doria, N. 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

Recommendations

• scientific article; zbMATH DE number 2109540
• Publication:4942040
• scientific article; zbMATH DE number 2182417
• scientific article; zbMATH DE number 1542872
• scientific article

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Decidability of theories and sets of sentences (03B25) Foundations of classical theories (including reverse mathematics) (03B30) Logic in computer science (03B70) Gödel numberings and issues of incompleteness (03F40) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (5)

• Title not available (Why is that?)
• Are the foundations of computer science logic-dependent?
• Computational processes and incompleteness
• Experimental logics as a model of development of deductive science and computational properties of undecidable sentences
• On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency

This page was built for publication: Metamathematical limits to computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829934)