{"id":"https://openalex.org/W3158113732","doi":"https://doi.org/10.46298/lmcs-18(2:17)2022","title":"Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens","display_name":"Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens","publication_year":2022,"publication_date":"2022-06-14","ids":{"openalex":"https://openalex.org/W3158113732","doi":"https://doi.org/10.46298/lmcs-18(2:17)2022","mag":"3158113732"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-18(2:17)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(2:17)2022","pdf_url":"https://lmcs.episciences.org/9696/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/9696/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067282848","display_name":"Dominik Kirst","orcid":"https://orcid.org/0000-0003-4126-6975"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominik Kirst","raw_affiliation_strings":["Saarland University, Saarland Informatics Campus, Saarbrcken, Germany","SIC - Saarland Informatics Campus (Germany)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbrcken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"SIC - Saarland Informatics Campus (Germany)","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069943669","display_name":"Dominique Larchey-Wendling","orcid":"https://orcid.org/0000-0001-9860-7203"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dominique Larchey-Wendling","raw_affiliation_strings":["Universit de Lorraine, CNRS, LORIA, Vandoeuvre-ls-Nancy, France","TYPES - Logic, Proof Theory and Programming (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit de Lorraine, CNRS, LORIA, Vandoeuvre-ls-Nancy, France","institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I90183372","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"TYPES - Logic, Proof Theory and Programming (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00377281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 18, Issue 2","issue":null,"first_page":null,"last_page":null},"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.9997000098228455,"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.9997000098228455,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9954000115394592,"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/T11567","display_name":"semigroups and automata theory","score":0.9871000051498413,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7878216505050659},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6861507296562195},{"id":"https://openalex.org/keywords/signature","display_name":"Signature (topology)","score":0.5760606527328491},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.556382417678833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5553907155990601},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5205660462379456},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.49895381927490234},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.44655388593673706},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.42195117473602295},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.4205556809902191},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.41157734394073486},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35405218601226807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2181447148323059},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11468294262886047}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7878216505050659},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6861507296562195},{"id":"https://openalex.org/C2779696439","wikidata":"https://www.wikidata.org/wiki/Q7512811","display_name":"Signature (topology)","level":2,"score":0.5760606527328491},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.556382417678833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5553907155990601},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5205660462379456},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.49895381927490234},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.44655388593673706},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.42195117473602295},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.4205556809902191},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.41157734394073486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35405218601226807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2181447148323059},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11468294262886047},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.46298/lmcs-18(2:17)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(2:17)2022","pdf_url":"https://lmcs.episciences.org/9696/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2104.14445","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2104.14445","pdf_url":"https://arxiv.org/pdf/2104.14445","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-03359508v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03359508","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 2022, 18 (2), pp.17:1-17:29. ⟨10.46298/lmcs-18(2:17)2022⟩","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:2e472e46650b4d808a9b2d0169de3e6c","is_oa":true,"landing_page_url":"https://doaj.org/article/2e472e46650b4d808a9b2d0169de3e6c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 18, Issue 2 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-18(2:17)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(2:17)2022","pdf_url":"https://lmcs.episciences.org/9696/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3158113732.pdf","grobid_xml":"https://content.openalex.org/works/W3158113732.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W25515096","https://openalex.org/W114225339","https://openalex.org/W1486095773","https://openalex.org/W1489366126","https://openalex.org/W1549008998","https://openalex.org/W1600140070","https://openalex.org/W1647170492","https://openalex.org/W1974265510","https://openalex.org/W2020686398","https://openalex.org/W2025750846","https://openalex.org/W2122160895","https://openalex.org/W2137628566","https://openalex.org/W2231754610","https://openalex.org/W2490033929","https://openalex.org/W2568721247","https://openalex.org/W2769209754","https://openalex.org/W2896864541","https://openalex.org/W2906883693","https://openalex.org/W2907081672","https://openalex.org/W2907653511","https://openalex.org/W2953924437","https://openalex.org/W2995956541","https://openalex.org/W3003294284","https://openalex.org/W3017177797","https://openalex.org/W3033842552","https://openalex.org/W3037360470","https://openalex.org/W3122736276","https://openalex.org/W3177449200","https://openalex.org/W4243994983","https://openalex.org/W4311008361","https://openalex.org/W4323980065"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2170336571","https://openalex.org/W2962928105","https://openalex.org/W2020140696","https://openalex.org/W4234189135"],"abstract_inverted_index":{"We":[0],"study":[1],"finite":[2],"first-order":[3,31,89],"satisfiability":[4],"(FSAT)":[5],"in":[6,141],"the":[7,30,37,54,73,78,83,93,107,142],"constructive":[8],"setting":[9],"of":[10,17,26,33,85,109,119,144,149],"dependent":[11],"type":[12],"theory.":[13],"Employing":[14],"synthetic":[15,150],"accounts":[16],"enumerability":[18,108],"and":[19,101],"decidability,":[20],"we":[21,81,122],"give":[22],"a":[23,67,128,145],"full":[24],"classification":[25],"FSAT":[27,48,86,110,132],"depending":[28],"on":[29,43],"signature":[32,55,94],"non-logical":[34],"symbols.":[35],"On":[36,77],"one":[38],"hand,":[39,80],"our":[40,124,137],"development":[41],"focuses":[42],"Trakhtenbrot's":[44,120],"theorem,":[45,121],"stating":[46],"that":[47],"is":[49],"undecidable":[50],"as":[51,53,104,106],"soon":[52],"contains":[56,96],"an":[57,117],"at":[58,97],"least":[59],"binary":[60],"relation":[61,102],"symbol.":[62],"Our":[63],"proof":[64],"proceeds":[65],"by":[66],"many-one":[68,129],"reduction":[69,125,130],"chain":[70,126],"starting":[71],"from":[72,131],"Post":[74],"correspondence":[75],"problem.":[76],"other":[79],"establish":[82],"decidability":[84],"for":[87,111],"monadic":[88],"logic,":[90],"i.e.":[91],"where":[92],"only":[95],"most":[98],"unary":[99],"function":[100],"symbols,":[103],"well":[105],"arbitrary":[112],"enumerable":[113],"signatures.":[114],"To":[115],"showcase":[116],"application":[118],"continue":[123],"with":[127],"to":[133],"separation":[134],"logic.":[135],"All":[136],"results":[138],"are":[139],"mechanised":[140],"framework":[143],"growing":[146],"Coq":[147],"library":[148],"undecidability":[151],"proofs.":[152]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2021-05-10T00:00:00"}