ON THE AVAILABLE PARTIAL RESPECTS IN WHICH AN AXIOMATIZATION FOR REAL VALUED ARITHMETIC CAN RECOGNIZE ITS CONSISTENCY.

Gödel's Second Incompleteness Theorem states axiom systems of sufficient strength are unable to verify their own consistency. We will show that axiomatizations for a computer's floating point arithmetic can recognize their cut-free consistency in a stronger respect than is feasible under integer ari...

Descripción completa

Detalles Bibliográficos

Publicado en:	Journal of Symbolic Logic Vol. 71; no. 4; pp. 1189 - 1200
Autor principal:	Willard, Dan E.
Formato:	Artículo
Publicado:	Cambridge University Press Dec2006
Materias:	Incompleteness theorems Gödel's theorem Axioms Foundations of geometry Foundations of arithmetic Mathematical logic
Acceso en línea:	Ver este registro en EBSCOhost