2000 character limit reached
Algèbres de réalisabilité: un programme pour bien ordonner R
Published 18 Feb 2010 in cs.LO and math.LO | (1002.3438v2)
Abstract: We give a method to transform into programs, classical proofs using a well ordering of the reals. The technics uses a generalization of Cohen's forcing and the theory of classical realizability introduced by the author.
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.
