{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:18Z","timestamp":1750220178600,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"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":[[2022,8,2]]},"DOI":"10.1145\/3531130.3532484","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A first-order completeness result about characteristic Boolean algebras in classical realizability"],"prefix":"10.1145","author":[{"given":"Guillaume","family":"Geoffroy","sequence":"first","affiliation":[{"name":"Institut de Recherche en Informatique Fondamentale, Universit\u00e9 Paris Cit\u00e9, France"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Hendrik\u00a0Pieter Barendregt. 1985. The lambda calculus - its syntax and semantics. Studies in logic and the foundations of mathematics Vol.\u00a0103. North-Holland.  Hendrik\u00a0Pieter Barendregt. 1985. The lambda calculus - its syntax and semantics. Studies in logic and the foundations of mathematics Vol.\u00a0103. North-Holland."},{"volume-title":"A Course in Universal Algebra","author":"Burris Stanley","key":"e_1_3_2_1_2_1","unstructured":"Stanley Burris and H.\u00a0 P. Sankappanavar . 1981. A Course in Universal Algebra . Springer . Stanley Burris and H.\u00a0P. Sankappanavar. 1981. A Course in Universal Algebra. Springer."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209140"},{"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","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-7(3:2)2011"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings TYPES 2014 - LIPIcs, Vol.\u00a039","author":"Krivine Jean-Louis","year":"2015","unstructured":"Jean-Louis Krivine . 2015 . On the structure of classical realizability models of ZF . In Proceedings TYPES 2014 - LIPIcs, Vol.\u00a039 . 146\u2013161. http:\/\/arxiv.org\/abs\/1408.1868 Jean-Louis Krivine. 2015. On the structure of classical realizability models of ZF. In Proceedings TYPES 2014 - LIPIcs, Vol.\u00a039. 146\u2013161. http:\/\/arxiv.org\/abs\/1408.1868"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00776-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(1:10)2012"},{"key":"e_1_3_2_1_9_1","volume-title":"A program for the full axiom of choice. Logical Methods in Computer Science","author":"Krivine Jean-Louis","year":"2021","unstructured":"Jean-Louis Krivine . 2021. A program for the full axiom of choice. Logical Methods in Computer Science Volume 17 , Issue 3 ( Sep 2021 ). https:\/\/doi.org\/10.46298\/lmcs-17(3:21)2021 10.46298\/lmcs-17(3:21)2021 Jean-Louis Krivine. 2021. A program for the full axiom of choice. Logical Methods in Computer Science Volume 17, Issue 3 (Sep 2021). https:\/\/doi.org\/10.46298\/lmcs-17(3:21)2021"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.47"},{"key":"e_1_3_2_1_11_1","volume-title":"first written","author":"Scott S.","year":"1969","unstructured":"Dana\u00a0 S. Scott . 1993 , first written 1969 . A Type-Theoretical Alternative to ISWIM, CUCH, OWHY.Theor. Comput. Sci . 121, 1&2 (1993, first written 1969), 411\u2013440. http:\/\/dblp.uni-trier.de\/db\/journals\/tcs\/tcs121.html#Scott93 Dana\u00a0S. Scott. 1993, first written 1969. A Type-Theoretical Alternative to ISWIM, CUCH, OWHY.Theor. Comput. Sci. 121, 1&2 (1993, first written 1969), 411\u2013440. http:\/\/dblp.uni-trier.de\/db\/journals\/tcs\/tcs121.html#Scott93"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003141"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3532484","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3532484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3532484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":12,"alternative-id":["10.1145\/3531130.3532484","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3532484","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}