Mathematics – Logic
Scientific paper
2005-01-26
Mathematics
Logic
in french
Scientific paper
This 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.
No associations
LandOfFree
No-counterexample interpretation et spécification des théorèmes de l'arithmétique does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with No-counterexample interpretation et spécification des théorèmes de l'arithmétique, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and No-counterexample interpretation et spécification des théorèmes de l'arithmétique will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-627873