Computer Science – Logic in Computer Science
Scientific paper
2008-09-14
Computer Science
Logic in Computer Science
34 p
Scientific paper
We show how to transform into programs the proofs in classical Analysis which
use the existence of an ultrafilter on the integers. The method mixes the
classical realizability introduced by the author, with the "forcing" of P.
Cohen. The programs we obtain, use read and write instructions in random access
memory.
No associations
LandOfFree
Structures de réalisabilité, RAM et ultrafiltre sur N 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 Structures de réalisabilité, RAM et ultrafiltre sur N, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structures de réalisabilité, RAM et ultrafiltre sur N will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-156194