{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:53:37Z","timestamp":1781855617304,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209140","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"462-471","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Classical realizability as a classifier for nondeterminism"],"prefix":"10.1145","author":[{"given":"Guillaume","family":"Geoffroy","sequence":"first","affiliation":[{"name":"Institut de math\u00e9matiques de Marseille, Aix-Marseille Universit\u00e9, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"R1","author":"Berry G.","year":"1976","unstructured":"G. Berry. 1976. Bottom-up computation of recursive programs. RAIRO - Theoretical Informatics and Applications - Informatique Th\u00c3\u013eorique et Applications 10, R1 (1976), 47--82. http:\/\/eudml.org\/doc\/92028"},{"key":"e_1_3_2_1_2_1","unstructured":"P.J. Cohen. 1966. Set theory and the continuum hypothesis. W. A. Benjamin. https:\/\/books.google.fr\/books?id=ZKc-AAAAIAAJ"},{"key":"e_1_3_2_1_3_1","unstructured":"S. Givant and P. Halmos. 2008. Introduction to Boolean Algebras. Springer New York. https:\/\/books.google.fr\/books?id=ORILyf8sF2sC"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96714"},{"key":"e_1_3_2_1_5_1","unstructured":"S. Kleene. 1952. Introduction to Metamathematics. (1952)."},{"key":"e_1_3_2_1_6_1","volume-title":"Realizability algebras: a program to well order R. Logical Methods in Computer Science 7, 3","author":"Krivine Jean-Louis","year":"2011","unstructured":"Jean-Louis Krivine. 2011. Realizability algebras: a program to well order R. Logical Methods in Computer Science 7, 3 (2011)."},{"key":"e_1_3_2_1_7_1","volume-title":"Realizability algebras III: some examples. CoRR abs\/1210.5065","author":"Krivine Jean-Louis","year":"2012","unstructured":"Jean-Louis Krivine. 2012. Realizability algebras III: some examples. CoRR abs\/1210.5065 (2012). arXiv:1210.5065 http:\/\/arxiv.org\/abs\/1210.5065"},{"key":"e_1_3_2_1_8_1","volume-title":"On the structure of classical realizability models of ZF. CoRR abs\/1408.1868","author":"Krivine Jean-Louis","year":"2014","unstructured":"Jean-Louis Krivine. 2014. On the structure of classical realizability models of ZF. CoRR abs\/1408.1868 (2014). arXiv:1408.1868 http:\/\/arxiv.org\/abs\/1408.1868"},{"key":"e_1_3_2_1_9_1","volume-title":"Typed lambda-calculus in classical Zermelo-Fr\u00e6nkel set theory. Archive for Mathematical Logic 40, 3 (01","author":"Krivine Jean-Louis","year":"2001","unstructured":"Jean-Louis Krivine. 2001. Typed lambda-calculus in classical Zermelo-Fr\u00e6nkel set theory. Archive for Mathematical Logic 40, 3 (01 Apr 2001), 189--205."},{"key":"e_1_3_2_1_10_1","volume-title":"Lambda-calculus types and models. (Feb","author":"Krivine Jean-Louis","year":"2002","unstructured":"Jean-Louis Krivine. 2002. Lambda-calculus types and models. (Feb. 2002), 208 pages. https:\/\/cel.archives-ouvertes.fr\/cel-00574575 Lecture."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00776-4"},{"key":"e_1_3_2_1_12_1","unstructured":"Jean-Louis Krivine. 2009. Realizability in classical logic. Panoramas et synth\u00e9ses 27(2009) 197--229. https:\/\/hal.archives-ouvertes.fr\/hal-00154500"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(1:10)2012"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02273-9_15"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.47"},{"key":"e_1_3_2_1_16_1","unstructured":"Lionel Rieg. 2014. On Forcing and Classical Realizability. Theses. Ecole normale sup\u00e9rieure de lyon - ENS LYON. https:\/\/tel.archives-ouvertes.fr\/tel-01061442"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07854-1_223"},{"key":"e_1_3_2_1_18_1","volume-title":"International Symposium on Mathematical Foundations of Computer Science. Springer, 411--417","author":"Trakhtenbrot Mark B","year":"1975","unstructured":"Mark B Trakhtenbrot. 1975, Russian version 1974. On representation of sequential and parallel functions. In International Symposium on Mathematical Foundations of Computer Science. Springer, 411--417."}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom","acronym":"LICS '18","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE-CS\\DATC IEEE Computer Society","EACSL European Association for Computer Science Logic"]},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209140","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:33:24Z","timestamp":1781854404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":18,"alternative-id":["10.1145\/3209108.3209140","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209140","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}