Krivine's classical realisability from a categorical perspective

Author:

STREICHER THOMAS

Abstract

In a sequence of papers (Krivine 2001; Krivine 2003; Krivine 2009), J.-L. Krivine introduced his notion of classical realisability for classical second-order logic and Zermelo–Fraenkel set theory. Moreover, in more recent work (Krivine 2008), he has considered forcing constructions on top of it with the ultimate aim of providing a realisability interpretation for the axiom of choice.The aim of the current paper is to show how Krivine's classical realisability can be understood as an instance of the categorical approach to realisability as started by Martin Hyland in Hyland (1982) and described in detail in van Oosten (2008). Moreover, we will give an intuitive explanation of the iteration of realisability as described in Krivine (2008).

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,Mathematics (miscellaneous)

Reference17 articles.

1. Krivine J.-L. (2010) Realizability algebras II: new models for ZF + DC. Avaialable from http://www.pps.jussieu.fr/~krivine/articles/R_ZF.pdf.

2. Dependent choice, ‘quote’ and the clock

3. Typed lambda-calculus in classical Zermelo-Frænkel set theory

4. Opérateurs de mise en mémoire et traduction de Gödel

5. Programming with proofs;Krivine;Journal of Information Processing and Cybernetics/Elektronische Informationsverarbeitung und Kybernetik,1990

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. On categorical structures arising from implicative algebras: From topology to assemblies;Annals of Pure and Applied Logic;2024-03

2. Evidenced Frames: A Unifying Framework Broadening Realizability Models;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

3. Implicative algebras: a new foundation for realizability and forcing;Mathematical Structures in Computer Science;2020-05

4. The category of implicative algebras and realizability;Mathematical Structures in Computer Science;2019-09-16

5. Realizability in ordered combinatory algebras with adjunction;Mathematical Structures in Computer Science;2018-04-26

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3