{"id":"https://openalex.org/W4406257879","doi":"https://doi.org/10.1145/3703595.3705882","title":"An Isabelle/HOL Framework for Synthetic Completeness Proofs","display_name":"An Isabelle/HOL Framework for Synthetic Completeness Proofs","publication_year":2025,"publication_date":"2025-01-10","ids":{"openalex":"https://openalex.org/W4406257879","doi":"https://doi.org/10.1145/3703595.3705882"},"language":"en","primary_location":{"id":"doi:10.1145/3703595.3705882","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3703595.3705882","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3703595.3705882","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087790624","display_name":"Asta Halkj\u00e6r From","orcid":"https://orcid.org/0000-0002-3601-0804"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Asta Halkj\u00e6r From","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087790624"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00248762,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"186"},"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.9994999766349792,"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.9994999766349792,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9944999814033508,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/hol","display_name":"HOL","score":0.97563236951828},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.8374389410018921},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.737891435623169},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.69646155834198},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6861213445663452},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3537556231021881},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1775284707546234}],"concepts":[{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.97563236951828},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8374389410018921},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.737891435623169},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.69646155834198},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6861213445663452},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3537556231021881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1775284707546234},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3703595.3705882","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3703595.3705882","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/9f96e617-eae6-42e7-b29c-ce369572562c","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/9f96e617-eae6-42e7-b29c-ce369572562c","pdf_url":"https://curis.ku.dk/ws/files/444488201/An_Isabelle_HOL.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"From , A H 2025 , An Isabelle/HOL Framework for Synthetic Completeness Proofs . in K Stark , A Timany , S Blazy & N Tabareau (eds) , CPP 2025 - Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs, Co-located with : POPL 2025 . Association for Computing Machinery, Inc. , pp. 171-186 , 14th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2025, co-located with POPL 2025 , Denver , United States , 20/01/2025 . https://doi.org/10.1145/3703595.3705882","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3703595.3705882","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3703595.3705882","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2909101356","display_name":null,"funder_award_id":"NNF20OC0063462","funder_id":"https://openalex.org/F4320325957","funder_display_name":"Novo Nordisk Fonden"}],"funders":[{"id":"https://openalex.org/F4320322436","display_name":"Novo Nordisk","ror":"https://ror.org/0435rc536"},{"id":"https://openalex.org/F4320325957","display_name":"Novo Nordisk Fonden","ror":"https://ror.org/04txyc737"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W101180772","https://openalex.org/W1517446920","https://openalex.org/W1554618854","https://openalex.org/W1591830785","https://openalex.org/W1821411012","https://openalex.org/W1999807931","https://openalex.org/W2015224901","https://openalex.org/W2022607815","https://openalex.org/W2027681638","https://openalex.org/W2061969020","https://openalex.org/W2067545168","https://openalex.org/W2109703800","https://openalex.org/W2121898499","https://openalex.org/W2534205211","https://openalex.org/W2762422546","https://openalex.org/W2787858359","https://openalex.org/W2904255103","https://openalex.org/W2909705055","https://openalex.org/W2969786701","https://openalex.org/W3188988341","https://openalex.org/W3204835784","https://openalex.org/W3208200734","https://openalex.org/W4211144022","https://openalex.org/W4214880480","https://openalex.org/W4250846042","https://openalex.org/W4323980065","https://openalex.org/W4400092021","https://openalex.org/W4406222038","https://openalex.org/W4412285861","https://openalex.org/W6893025106"],"related_works":["https://openalex.org/W2585743557","https://openalex.org/W1594958113","https://openalex.org/W3193153727","https://openalex.org/W2477568018","https://openalex.org/W43811100","https://openalex.org/W1581380057","https://openalex.org/W3098927713","https://openalex.org/W1819460135","https://openalex.org/W4295798319","https://openalex.org/W3085888268"],"abstract_inverted_index":{"Proof":[0],"assistants":[1],"like":[2],"Isabelle/HOL":[3],"provide":[4],"the":[5,47,77,81,102,123,127],"perfect":[6],"opportunity":[7],"to":[8,52],"develop":[9],"more":[10],"than":[11],"just":[12],"one-off":[13],"formalizations,":[14],"but":[15],"frameworks":[16],"for":[17,27,59,89,119,145,149],"developing":[18],"new":[19],"results":[20,26,72],"within":[21],"a":[22,66,87,96,156,161,171],"given":[23,97],"area.":[24],"Completeness":[25],"logical":[28],"calculi":[29],"often":[30],"include":[31],"bespoke":[32],"versions":[33],"of":[34,46,62,80,122,163],"Lindenbaum's":[35],"lemma.":[36],"In":[37],"this":[38],"paper,":[39],"I":[40,69,85,130,141],"mechanize":[41,142],"an":[42],"abstract,":[43],"transfinite":[44],"version":[45],"lemma":[48,104],"and":[49,108,112,137],"use":[50],"it":[51,132,169],"build":[53],"witnessed,":[54],"maximal":[55],"consistent":[56],"sets":[57],"(MCSs)":[58],"any":[60],"notion":[61],"consistency":[63],"that":[64,105],"satisfies":[65],"few":[67],"requirements.":[68],"prove":[70],"abstract":[71],"about":[73],"when":[74],"MCSs":[75],"reflect":[76],"proof":[78,117],"rules":[79],"underlying":[82],"calculi.":[83],"Finally,":[84],"formalize":[86],"process":[88],"mechanically":[90],"calculating":[91],"saturated":[92],"set":[93,162],"conditions":[94],"from":[95,170],"logic's":[98],"semantics.":[99],"This":[100],"separates":[101],"truth":[103],"connects":[106],"MCS-membership":[107],"satisfiability":[109],"into":[110],"semantic":[111],"syntactic":[113],"components,":[114],"giving":[115],"concrete":[116],"obligations":[118],"each":[120,146],"operator":[121],"logic.":[124],"To":[125],"illustrate":[126],"framework's":[128],"applicability,":[129],"instantiate":[131],"with":[133],"propositional,":[134],"first-order,":[135],"modal":[136],"hybrid":[138],"logic":[139],"examples.":[140],"strong":[143],"completeness":[144],"logic,":[147],"even":[148],"uncountably":[150],"large":[151],"languages,":[152],"proving":[153],"that,":[154],"if":[155],"formula":[157],"is":[158],"valid":[159],"under":[160],"assumptions,":[164],"then":[165],"we":[166],"can":[167],"derive":[168],"finite":[172],"subset.":[173]},"counts_by_year":[],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}