{"id":"https://openalex.org/W2520797183","doi":"https://doi.org/10.1145/2946799","title":"Where First-Order and Monadic Second-Order Logic Coincide","display_name":"Where First-Order and Monadic Second-Order Logic Coincide","publication_year":2016,"publication_date":"2016-09-10","ids":{"openalex":"https://openalex.org/W2520797183","doi":"https://doi.org/10.1145/2946799","mag":"2520797183"},"language":"en","primary_location":{"id":"doi:10.1145/2946799","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2946799","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031690987","display_name":"Michael Elberfeld","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Elberfeld","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003607737","display_name":"Till Tantau","orcid":"https://orcid.org/0000-0002-3946-8028"},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Till Tantau","raw_affiliation_strings":["Universit\u00e4t zu L\u00fcbeck, L\u00fcbeck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t zu L\u00fcbeck, L\u00fcbeck, Germany","institution_ids":["https://openalex.org/I9341345"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2441,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.92604124,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"17","issue":"4","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9901999831199646,"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/mathematics","display_name":"Mathematics","score":0.798632025718689},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.574525773525238},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5592646598815918},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.5582319498062134},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.486299604177475},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47813665866851807},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.4555065631866455},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4525548219680786},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.4452192783355713},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.44399285316467285},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44141268730163574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4173204302787781},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2993309497833252},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.20388254523277283},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14894679188728333},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1399829089641571},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12286928296089172},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10690426826477051},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.07200458645820618}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.798632025718689},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.574525773525238},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5592646598815918},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.5582319498062134},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.486299604177475},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47813665866851807},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.4555065631866455},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4525548219680786},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.4452192783355713},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.44399285316467285},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44141268730163574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4173204302787781},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2993309497833252},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.20388254523277283},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14894679188728333},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1399829089641571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12286928296089172},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10690426826477051},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.07200458645820618},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2946799","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2946799","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W137331784","https://openalex.org/W587223573","https://openalex.org/W1489366126","https://openalex.org/W1511526676","https://openalex.org/W1623604111","https://openalex.org/W1978747958","https://openalex.org/W1983682288","https://openalex.org/W2045583484","https://openalex.org/W2052210031","https://openalex.org/W2063766677","https://openalex.org/W2085467680","https://openalex.org/W2116250539","https://openalex.org/W2131742729","https://openalex.org/W2149330764","https://openalex.org/W2170478756","https://openalex.org/W2179506702","https://openalex.org/W3104927320","https://openalex.org/W3121437753","https://openalex.org/W4205178514"],"related_works":["https://openalex.org/W4231685078","https://openalex.org/W2064994844","https://openalex.org/W3119127574","https://openalex.org/W1580758018","https://openalex.org/W1980692207","https://openalex.org/W1481876218","https://openalex.org/W2008235772","https://openalex.org/W2065443441","https://openalex.org/W2585873599","https://openalex.org/W2520797183"],"abstract_inverted_index":{"We":[0,24],"study":[1],"on":[2,47],"which":[3],"classes":[4,29,91],"of":[5,31,68,84,112,142],"graphs":[6,32],"first-order":[7],"logic":[8,15,106],"(":[9,16,107],"fo":[10,39],")":[11,18],"and":[12,40,50],"monadic":[13],"second-order":[14,105],"mso":[17,41,113],"have":[19,42],"the":[20,43,66,82,110],"same":[21,44],"expressive":[22,45],"power.":[23],"show":[25,99],"that":[26,33,64,78,114,137],"for":[27,103,139],"all":[28],"C":[30,48,53],"are":[34],"closed":[35,93],"under":[36,94],"taking":[37,95],"subgraphs,":[38,97],"power":[46],"if":[49],"only":[51,116],"if,":[52],"has":[54],"bounded":[55],"tree":[56,79],"depth.":[57],"Tree":[58],"depth":[59],"is":[60,133],"a":[61,69,72,75,85,88,134],"graph":[62,70,86],"invariant":[63],"measures":[65,81],"similarity":[67,83],"to":[71,87],"star":[73],"in":[74,130],"similar":[76],"way":[77],"width":[80],"tree.":[89],"For":[90],"just":[92],"induced":[96],"we":[98],"an":[100],"analogous":[101],"result":[102],"guarded":[104],"gso":[108],"),":[109],"variant":[111],"not":[115],"allows":[117],"quantification":[118],"over":[119,124],"vertex":[120],"sets":[121],"but":[122],"also":[123],"edge":[125],"sets.":[126],"A":[127],"key":[128],"tool":[129],"our":[131],"proof":[132],"Feferman--Vaught-type":[135],"theorem":[136],"works":[138],"infinite":[140],"collections":[141],"structures":[143],"despite":[144],"being":[145],"constructive.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}