Stateful Realizers for Nonstandard Analysis
| dc.contributor.author | Dinis, Bruno | |
| dc.contributor.author | Miquey, Étienne | |
| dc.date.accessioned | 2023-07-17T15:00:26Z | |
| dc.date.available | 2023-07-17T15:00:26Z | |
| dc.date.issued | 2023-04 | |
| dc.description.abstract | In this paper we propose a new approach to realizability interpretations for nonstandard arithmetic. We deal with nonstandard analysis in the context of (semi) intuitionistic realizability, focusing on the Lightstone-Robinson construction of a model for nonstandard analysis through an ultrapower. In particular, we consider an extension of the lambda-calculus with a memory cell, that contains an integer (the state), in order to indicate in which slice of the ultrapower M^N the computation is being done. We pay attention to the nonstandard principles (and their computational content) obtainable in this setting. In particular, we give non-trivial realizers to Idealization and a non-standard version of the LLPO principle. We then discuss how to quotient this product to mimic the Lightstone-Robinson construction. | por |
| dc.description.sponsorship | FCT - Fundação para a Ciência e a Tecnologia, CMAFcIO - Centro de Matemática, Aplicações Fundamentais e Investigação Operacional e CIMA - Centro de Investigação em Matemática e Aplicações: UIDB/04561/2020, UIDP/04561/2020 e UIDP/04674/2020. | por |
| dc.identifier.authoremail | bruno.dinis@uevora.pt | |
| dc.identifier.authoremail | etienne.miquey@univ-amu.fr | |
| dc.identifier.citation | Bruno Dinis ; Étienne Miquey - Stateful Realizers for Nonstandard Analysis lmcs:10137 - Logical Methods in Computer Science, April 25, 2023, Volume 19, Issue 2 - https://doi.org/10.46298/lmcs-19(2:7)2023 | por |
| dc.identifier.doi | 10.46298/lmcs-19(2:7)2023 | por |
| dc.identifier.scientificarea | 332 | por |
| dc.identifier.uri | https://lmcs.episciences.org/11243 | |
| dc.identifier.uri | http://hdl.handle.net/10174/35335 | |
| dc.language.iso | por | por |
| dc.peerreviewed | yes | por |
| dc.publisher | Logical Methods in Computer Science | por |
| dc.rights | openAccess | por |
| dc.subject | realizabiliy | por |
| dc.subject | nonstandard arithmetic | por |
| dc.subject | stateful computations | por |
| dc.subject | ultrafilters | por |
| dc.subject | glueing | por |
| dc.title | Stateful Realizers for Nonstandard Analysis | por |
| dc.type | article | por |