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
Stateful Realizers for Nonstandard AnalysisArticle

Authors: Bruno Dinis ORCID; Étienne Miquey

    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 $\cal{M}^{\mathbb{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.


    Volume: Volume 19, Issue 2
    Published on: April 25, 2023
    Accepted on: March 22, 2023
    Submitted on: October 12, 2022
    Keywords: Computer Science - Logic in Computer Science

    Consultation statistics

    This page has been seen 1762 times.
    This article's PDF has been downloaded 381 times.