2000 character limit reached
Structures de réalisabilité, RAM et ultrafiltre sur N
Published 14 Sep 2008 in cs.LO | (0809.2394v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.