2005 | OriginalPaper | Buchkapitel
On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency
verfasst von : Dan E. Willard
Erschienen in: Automated Reasoning with Analytic Tableaux and Related Methods
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.