English

Stateful Realizers for Nonstandard Analysis

Logic in Computer Science 2024-02-14 v4

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 MN\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.

Cite

@article{arxiv.2210.05346,
  title  = {Stateful Realizers for Nonstandard Analysis},
  author = {Bruno Dinis and Étienne Miquey},
  journal= {arXiv preprint arXiv:2210.05346},
  year   = {2024}
}
R2 v1 2026-06-28T03:14:06.516Z