Please use this identifier to cite or link to this item: http://hdl.handle.net/10174/35335

Title: Stateful Realizers for Nonstandard Analysis
Authors: Dinis, Bruno
Miquey, Étienne
Keywords: realizabiliy
nonstandard arithmetic
stateful computations
ultrafilters
glueing
Issue Date: Apr-2023
Publisher: Logical Methods in Computer Science
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
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.
URI: https://lmcs.episciences.org/11243
http://hdl.handle.net/10174/35335
Type: article
Appears in Collections:CIMA - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica

Files in This Item:

File Description SizeFormat
2023 - Stateful realizers for NSA.pdf615.91 kBAdobe PDFView/Open
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Dspace Dspace
DSpace Software, version 1.6.2 Copyright © 2002-2008 MIT and Hewlett-Packard - Feedback
UEvora B-On Curriculum DeGois