No-counterexample interpretation et spécification des théorèmes de l'arithmétique

Simple item page
dc.creatorBonnay, Denis
dc.date2005-01-26
dc.date.accessioned2026-07-07T05:16:26Z
dc.date.available2026-07-07T05:16:26Z
dc.descriptionThis paper presents two different ways of extracting the computational content of formal proofs in arithmetic. The first one corresponds to Kreisel's No-counterexample Interpretation. based on Ackermann consistency proof. We show the link with recent work by Krivine on classical realizability. Finally, we discuss the various degrees of modularity of both approaches.
dc.descriptionin french
dc.identifierhttps://arxiv.org/abs/math/0501476
dc.identifierhttp://arxiv.org/abs/math/0501476
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/73988
dc.subjectLogic
dc.subjectMSC: 03F30
dc.titleNo-counterexample interpretation et spécification des théorèmes de l'arithmétique
dc.typetext

Files

Collections

arXiv