Realizability Semantics is a formal semantics for intuitionistic logic in which the truth of propositions is interpreted through the existence of computational realizers—typically functions or programs—that witness their constructive validity, thereby distinguishing it from classical model-theoretic semantics by grounding logical truth in effective computational evidence.
68
Publications
2.2K
Citations
87
Authors
68
Institutions
Publications per year
2017–2026
8
Parents
Publications
68
On the computational content of the axiom of choice
Stefano Berardi, Marc Bezem, Thierry Coquand · Journal of Symbolic Logic · 1998 · 102 citations
Syntax and Semantics of Quantitative Type Theory
Robert Atkey · 2018 · 94 citations
1–5 of 68
Authors
87
- MH
5
h-index
- PO
3
h-index
- LB
3
h-index
- NB
3
h-index
- SB
3
h-index
1–5 of 87
Institutions
68
École Normale Supérieure de Lyon
Lyon, France
5 h-index
5 publications
124 citations
Queen Mary University of London
London, United Kingdom
4 h-index
4 publications
97 citations
University of Turin
Turin, Italy
4 h-index
5 publications
180 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
6 publications
98 citations
Universidad de la República de Uruguay
Montevideo, Uruguay
3 h-index
4 publications
68 citations
University of Edinburgh
Edinburgh, United Kingdom
3 h-index
5 publications
118 citations
Utrecht University
Utrecht, The Netherlands
3 h-index
3 publications
139 citations
Centre National de la Recherche Scientifique
Paris, France
3 h-index
4 publications
144 citations
1–8 of 68
Venues
- Electronic Notes in Theoretical Computer Science
ENTCS · 5 publications · 97 citations
5
h-index
- Journal of Symbolic Logic
5 publications · 217 citations
5
h-index
- Logical Methods in Computer Science
LMCS · 2 publications · 55 citations
3
h-index
- Mathematical Structures in Computer Science
MSCS · 3 publications · 71 citations
3
h-index
- Archive for Mathematical Logic
2 publications · 28 citations
2
h-index
1–5