Structures de réalisabilité, RAM et ultrafiltre sur N

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-156194

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.