Advertisement
Published in:
2005 | OriginalPaper | Chapter
On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency
Author : Dan E. Willard
Published in: Automated Reasoning with Analytic Tableaux and Related Methods
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Gödel’s Second Incompleteness Theorem states axiom systems of sufficient strength are unable to verify their own consistency. We will show this theorem does not preclude axiomizations for a computer’s floating point arithmetic from recognizing their own consistency, in certain well defined partial respects.