Uniform Realizability Interpretations
Electronic Proceedings in Theoretical Computer Science · 2026-03-04 · 441 · 46-61
DOI: 10.4204/eptcs.441.3 ↗At a glance
Journal article in Electronic Proceedings in Theoretical Computer Science, published online on 2026-03-04. Written by Ulrich Berger and 1 co-authors. 18 references.
Abstract (original language)
This work introduces a novel framework of uniform realizability that unifies and generalizes various realizability interpretations of logic, particularly focussing on the treatment of atomic formulas and quantifiers. Traditional realizability interpretations (such as Kleene's number realizability) require explicit witnesses for existential quantifiers. In contrast, newer approaches, such as in the first author's uniform Heyting arithmetic, Herbrand realizability of non-standard arithmetic, or in the"classical"realizability of arithmetic, (some) quantifiers, are treated uniformly. The proposed notion of uniform realizability abstracts these differences, parametrising the interpretation by a given treatment of atomic formulas, accounting for both classical and modern variants. The approach is illustrated using several realizability interpretations of Heyting arithmetic.
Cite
APA
Berger, U., & Oliva, P. (2026). Uniform Realizability Interpretations. Electronic Proceedings in Theoretical Computer Science, 441, 46-61. https://doi.org/10.4204/eptcs.441.3
Vancouver
Berger U, Oliva P. Uniform Realizability Interpretations. Electronic Proceedings in Theoretical Computer Science. 2026;441:46-61. doi:10.4204/eptcs.441.3
BibTeX
@article{Berger2026,
author = {Berger, Ulrich and Oliva, Paulo},
title = {Uniform Realizability Interpretations},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {441},
pages = {46--61},
doi = {10.4204/eptcs.441.3}
}
EUVIMED