Realizability algebras III: some examples

DOI10.1017/S0960129516000050zbMath1383.03023arXiv1210.5065MaRDI QIDQ4599612

Jean-Louis Krivine

Publication date: 4 January 2018

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Consistency and independence results (03E35) Axiom of choice and related propositions (03E25) Combinatory logic and lambda calculus (03B40)

Related Items (3)

REALIZING REALIZABILITY RESULTS WITH CLASSICAL CONSTRUCTIONS ⋮ Preserving cardinals and weak forms of Zorn’s lemma in realizability models ⋮ Unnamed Item

Cites Work

• Dependent choice, `quote' and the clock
• Realizability algebras II : new models of ZF + DC
• Realizability algebras: a program to well order R
• On the computational content of the axiom of choice
• The consistency of classical set theory relative to a set theory with intu1tionistic logic
• On the Interpretation of Non-Finitist Proofs--Part I
• On the interpretation of non-finitist proofs–Part II
• Typed lambda-calculus in classical Zermelo-Fraenkel set theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Realizability algebras III: some examples