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

Simple item page
dc.creatorKrivine, Jean-Louis
dc.date2008-09-14
dc.date.accessioned2026-07-07T10:02:47Z
dc.date.available2026-07-07T10:02:47Z
dc.descriptionWe 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.
dc.description34 p
dc.identifierhttps://arxiv.org/abs/0809.2394
dc.identifierhttp://arxiv.org/abs/0809.2394
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169099
dc.subjectLogic in Computer Science
dc.titleStructures de réalisabilité, RAM et ultrafiltre sur N
dc.typetext

Files

Collections

arXiv