A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus

DOI10.23638/LMCS-13(4:24)2017zbMath1459.03017arXiv1407.1547MaRDI QIDQ4596803

Thomas Streicher

Publication date: 11 December 2017

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

zbMATH Keywords

categorical logicclassical realizabilitybar recursion

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Topoi (18B25) Combinatory logic and lambda calculus (03B40)

Related Items (2)

On Tarski’s fixed point theorem ⋮ Unnamed Item

This page was built for publication: A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus