{"id":"https://openalex.org/W4289793251","doi":"https://doi.org/10.1145/3531130.3532484","title":"A first-order completeness result about characteristic Boolean algebras in classical realizability","display_name":"A first-order completeness result about characteristic Boolean algebras in classical realizability","publication_year":2022,"publication_date":"2022-08-02","ids":{"openalex":"https://openalex.org/W4289793251","doi":"https://doi.org/10.1145/3531130.3532484"},"language":"en","primary_location":{"id":"doi:10.1145/3531130.3532484","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3531130.3532484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2209.08838","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069401831","display_name":"Guillaume Geoffroy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117673","display_name":"Institut de Recherche en Informatique Fondamentale","ror":"https://ror.org/02krdtz55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210089394","https://openalex.org/I4210117673","https://openalex.org/I4210139971"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Guillaume Geoffroy","raw_affiliation_strings":["Institut de Recherche en Informatique Fondamentale, Universit\u00e9 Paris Cit\u00e9, France","Institut de Recherche en Informatique Fondamentale","Universit\u00e9 Paris Cit\u00e9"],"affiliations":[{"raw_affiliation_string":"Institut de Recherche en Informatique Fondamentale, Universit\u00e9 Paris Cit\u00e9, France","institution_ids":["https://openalex.org/I4210117673","https://openalex.org/I204730241"]},{"raw_affiliation_string":"Institut de Recherche en Informatique Fondamentale","institution_ids":["https://openalex.org/I4210117673"]},{"raw_affiliation_string":"Universit\u00e9 Paris Cit\u00e9","institution_ids":["https://openalex.org/I204730241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069401831"],"corresponding_institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210117673"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08515225,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/realizability","display_name":"Realizability","score":0.9760873317718506},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7817373275756836},{"id":"https://openalex.org/keywords/boolean-algebra","display_name":"Boolean algebra","score":0.7219226360321045},{"id":"https://openalex.org/keywords/complete-boolean-algebra","display_name":"Complete Boolean algebra","score":0.6865906715393066},{"id":"https://openalex.org/keywords/boolean-domain","display_name":"Boolean domain","score":0.6758801341056824},{"id":"https://openalex.org/keywords/stones-representation-theorem-for-boolean-algebras","display_name":"Stone's representation theorem for Boolean algebras","score":0.6603291630744934},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.5704981684684753},{"id":"https://openalex.org/keywords/boolean-algebras-canonically-defined","display_name":"Boolean algebras canonically defined","score":0.5585576891899109},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5477357506752014},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.5322672724723816},{"id":"https://openalex.org/keywords/free-boolean-algebra","display_name":"Free Boolean algebra","score":0.5063587427139282},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44564875960350037},{"id":"https://openalex.org/keywords/classical-logic","display_name":"Classical logic","score":0.4116644263267517},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40788930654525757},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.23920336365699768},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15840715169906616},{"id":"https://openalex.org/keywords/algebra-representation","display_name":"Algebra representation","score":0.11578112840652466}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.9760873317718506},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7817373275756836},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.7219226360321045},{"id":"https://openalex.org/C81518389","wikidata":"https://www.wikidata.org/wiki/Q5156447","display_name":"Complete Boolean algebra","level":5,"score":0.6865906715393066},{"id":"https://openalex.org/C4926405","wikidata":"https://www.wikidata.org/wiki/Q3269980","display_name":"Boolean domain","level":5,"score":0.6758801341056824},{"id":"https://openalex.org/C10021369","wikidata":"https://www.wikidata.org/wiki/Q1166774","display_name":"Stone's representation theorem for Boolean algebras","level":5,"score":0.6603291630744934},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.5704981684684753},{"id":"https://openalex.org/C45503250","wikidata":"https://www.wikidata.org/wiki/Q4943350","display_name":"Boolean algebras canonically defined","level":5,"score":0.5585576891899109},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5477357506752014},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.5322672724723816},{"id":"https://openalex.org/C188159880","wikidata":"https://www.wikidata.org/wiki/Q5499761","display_name":"Free Boolean algebra","level":5,"score":0.5063587427139282},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44564875960350037},{"id":"https://openalex.org/C32241873","wikidata":"https://www.wikidata.org/wiki/Q236975","display_name":"Classical logic","level":2,"score":0.4116644263267517},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40788930654525757},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.23920336365699768},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15840715169906616},{"id":"https://openalex.org/C14394260","wikidata":"https://www.wikidata.org/wiki/Q4723980","display_name":"Algebra representation","level":3,"score":0.11578112840652466},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3531130.3532484","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3531130.3532484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2209.08838","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2209.08838","pdf_url":"https://arxiv.org/pdf/2209.08838","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-03779966v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03779966","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa, Israel. pp.1-8, ⟨10.1145/3531130.3532484⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2209.08838","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2209.08838","pdf_url":"https://arxiv.org/pdf/2209.08838","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1971613396","https://openalex.org/W2047559554","https://openalex.org/W2111069606","https://openalex.org/W2118238767","https://openalex.org/W2126988924","https://openalex.org/W2135287414","https://openalex.org/W2798724293","https://openalex.org/W3035081881","https://openalex.org/W3098060485","https://openalex.org/W3098075529","https://openalex.org/W3098832446","https://openalex.org/W4293176479"],"related_works":["https://openalex.org/W2940617399","https://openalex.org/W4256012180","https://openalex.org/W2369221237","https://openalex.org/W2377493875","https://openalex.org/W2950480058","https://openalex.org/W4298032558","https://openalex.org/W2740171735","https://openalex.org/W1974935489","https://openalex.org/W2143150930","https://openalex.org/W2148363933"],"abstract_inverted_index":{"We":[0],"prove":[1],"the":[2,54],"following":[3],"completeness":[4],"result":[5],"about":[6],"classical":[7,22],"realizability:":[8],"given":[9],"any":[10],"Boolean":[11,27],"algebra":[12,28],"with":[13],"at":[14],"least":[15],"two":[16],"elements,":[17],"there":[18],"exists":[19],"a":[20],"Krivine-style":[21],"realizability":[23],"model":[24,56],"whose":[25],"characteristic":[26],"is":[29,35],"elementarily":[30],"equivalent":[31],"to":[32],"it.":[33],"This":[34],"done":[36],"by":[37],"controlling":[38],"precisely":[39],"which":[40],"combinations":[41],"of":[42,57],"so-called":[43],"\u201cangelic\u201d":[44],"(or":[45,49],"\u201cmay\u201d)":[46],"and":[47],"\u201cdemonic\u201d":[48],"\u201cmust\u201d)":[50],"nondeterminism":[51],"exist":[52],"in":[53],"underlying":[55],"computation.":[58]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}