Realizability algebras II : new models of ZF + DC-Reference-Cited by-同舟云学术

Realizability algebras II : new models of ZF + DC

Published:2012-02-27 Issue:1 Volume:8 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Krivine Jean-Louis

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. On the computational content of the axiom of choice

2. H.B. Curry, R. Feys.Combinatory Logic.North-Holland (1958).

3. Powers of regular cardinals

4. The consistency of classical set theory relative to a set theory with intu1tionistic logic

5. H. Friedman.Classically and intuitionistically provably recursive functions.In: Higher set theory. Springer Lect. Notes in Math. 669 (1977) p. 21-27.

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

1. A first-order completeness result about characteristic Boolean algebras in classical realizability;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

2. A program for the full axiom of choice;Logical Methods in Computer Science;2021-09-01

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

4. Preserving cardinals and weak forms of Zorn’s lemma in realizability models;Mathematical Structures in Computer Science;2020-10

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