The theory of classical realizability was introduced by Krivine [Kri09] in the middle of the 90's in order to analyze the computational contents of classical proofs, following the connection between classical reasoning and control operators discovered by Griffin [Gri90]. More than an extension of the theory of intuitionistic realizability, classical realizability is a complete reformulation of the very principles of realizability based on a combination [OS08, Miq10] of Kleene's realizability [Kle45] with Friedman's A-translation [Fri78]. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Miquel, A. (2011). A survey of classical realizability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6690 LNCS, pp. 1–2). https://doi.org/10.1007/978-3-642-21691-6_1
Mendeley helps you to discover research relevant for your work.