Realizability with stateful computations for nonstandard analysis
From MaRDI portal
Cites work
- A functional interpretation for nonstandard arithmetic
- A model for intuitionistic non-standard arithmetic
- Bar recursion in classical realisability: dependent choice and continuum hypothesis
- Constructive forcing, CPS translations and witness extraction in interactive realizability
- Continuity between Cauchy and Bolzano: issues of antecedents and priority
- Existential witness extraction in classical realizability and via a negative translation
- scientific article; zbMATH DE number 5851813 (Why is no real title available?)
- scientific article; zbMATH DE number 3166227 (Why is no real title available?)
- scientific article; zbMATH DE number 4038137 (Why is no real title available?)
- scientific article; zbMATH DE number 177651 (Why is no real title available?)
- scientific article; zbMATH DE number 3473961 (Why is no real title available?)
- scientific article; zbMATH DE number 3014189 (Why is no real title available?)
- scientific article; zbMATH DE number 3275554 (Why is no real title available?)
- scientific article; zbMATH DE number 2236625 (Why is no real title available?)
- Implicative algebras: a new foundation for realizability and forcing
- Internal set theory: A new approach to nonstandard analysis
- Interpreting weak Kőnig's lemma in theories of nonstandard arithmetic
- Intuitionistic nonstandard bounded modified realisability and functional interpretation
- Leibniz's infinitesimals: their fictionality, their modern implementations, and their foes from Berkeley to Russell and beyond
- Minimal models of Heyting arithmetic
- Neutrices and External Numbers
- Non-standard analysis
- Nonstandard functional interpretations and categorical models
- On the interpretation of intuitionistic number theory
- On the Interpretation of Non-Finitist Proofs--Part I
- Radically Elementary Probability Theory. (AM-117)
- Realizability algebras: a program to well order \(\mathbb R\)
- Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control
- Realizability. An introduction to its categorical side
- Typed lambda-calculus in classical Zermelo-Fraenkel set theory
- Une contribution à la théorie de la mesure.
- Zur Deutung der intuitionistischen Logik
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
This page was built for publication: Realizability with stateful computations for nonstandard analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839817)
