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

DOI10.3233/COM-170074zbMath1436.03238arXiv1502.03622MaRDI QIDQ4608444

Sam Sanders

Publication date: 16 March 2018

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03622

zbMATH Keywords

nonstandard analysishigher-order computability theoryGandy-Hyland functional

Mathematics Subject Classification ID

Nonstandard models in mathematics (03H05) Higher-type and set recursion theory (03D65)

Related Items (7)

Reverse mathematics and parameter-free transfer ⋮ To be or not to be constructive, that is not the question ⋮ On the Herbrand functional interpretation ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Pincherle's theorem in reverse mathematics and computability theory ⋮ On the mathematical and foundational significance of the uncountable ⋮ The strength of compactness in computability theory and nonstandard analysis

This page was built for publication: The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis