On the public citation graph

The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis

https://doi.org/10.3233/com-170074
0 signed · 35 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-77533-1openalex-snapshot
Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
inferredcites →https://doi.org/10.1007/978-3-642-68952-9openalex-snapshot
Foundations of Constructive Mathematics
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/978-3-662-47992-6openalex-snapshot
Higher-Order Computability
inferredcites →https://doi.org/10.1007/bfb0066739openalex-snapshot
Metamathematical Investigation of Intuitionistic Arithmetic and Analysis
inferredcites →https://doi.org/10.1007/bfb0098600openalex-snapshot
Recursion on the Countable Functionals
inferredcites →https://doi.org/10.1016/j.apal.2012.07.003openalex-snapshot
A functional interpretation for nonstandard arithmetic
inferredcites →https://doi.org/10.1016/s0049-237x(09)70437-9openalex-snapshot
Computable and recursively countable functions of higher type
inferredcites →https://doi.org/10.1016/s0049-237x(09)70439-2openalex-snapshot
Model of Partial Continuous Functionals
inferredcites →https://doi.org/10.1016/s0049-237x(98)80016-5openalex-snapshot
An Introduction to Proof Theory
inferredcites →https://doi.org/10.1016/s1385-7258(61)50044-3openalex-snapshot
NON-STANDARD ANALYSIS
inferredcites →https://doi.org/10.1017/9781316755846.018openalex-snapshot
Higher order reversemathematics
inferredcites →https://doi.org/10.1017/9781316755860.004openalex-snapshot
Modified bar recursion and classical dependent choice
inferredcites →https://doi.org/10.1017/9781316755983.005openalex-snapshot
Foundational and mathematical uses of higher types
inferredcites →https://doi.org/10.1017/cbo9780511581007openalex-snapshot
Subsystems of Second Order Arithmetic
inferredcites →https://doi.org/10.1017/s0960129506005093openalex-snapshot
Modified bar recursion
inferredcites →https://doi.org/10.1090/s0002-9904-1977-14398-xopenalex-snapshot
Internal set theory: A new approach to nonstandard analysis
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1111/j.1746-8361.1958.tb01464.xopenalex-snapshot
Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes
inferredcites →https://doi.org/10.1201/9781439865736-3openalex-snapshot
MODIFIED BAR RECURSION AND CLASSICAL DEPENDENT CHOICE
inferredcites →https://doi.org/10.2307/2273661openalex-snapshot
Characterizing the continuous functionals
inferredcites →https://doi.org/10.2307/2586626openalex-snapshot
Hyperfinite type structures
inferredcites →https://doi.org/10.4230/lipics.tlca.2015.153openalex-snapshot
The Inconsistency of a Brouwerian Continuity Principle with the Curry–Howard Interpretation
inferredcites →https://doi.org/10.48550/arxiv.1412.2022openalex-snapshot
The taming of the Reverse Mathematics zoo

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.201900067openalex-snapshot
On the Herbrand functional interpretation
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_32openalex-snapshot
Functionals of Type 3 as Realisers of Classical Theorems in Analysis
inferred← citeshttps://doi.org/10.1016/j.apal.2018.10.003openalex-snapshot
Reverse Mathematics and parameter-free Transfer
inferred← citeshttps://doi.org/10.1016/j.apal.2019.05.007openalex-snapshot
The strength of compactness in Computability Theory and Nonstandard Analysis
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102788openalex-snapshot
Pincherle's theorem in reverse mathematics and computability theory
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103505openalex-snapshot
On the logical and computational properties of the Vitali covering theorem
inferred← citeshttps://doi.org/10.1093/logcom/exaa019openalex-snapshot
The unreasonable effectiveness of Nonstandard Analysis
inferred← citeshttps://doi.org/10.1093/logcom/exaa049openalex-snapshot
Open sets in computability theory and reverse mathematics
inferred← citeshttps://doi.org/10.1093/logcom/exaa080openalex-snapshot
The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis
inferred← citeshttps://doi.org/10.1142/s0219061319500016openalex-snapshot
On the mathematical and foundational significance of the uncountable
inferred← citeshttps://doi.org/10.48550/arxiv.2009.11424openalex-snapshot
Naïve Infinitesimal Analysis: Its Construction and Its Properties
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.