{"id":"https://openalex.org/W2743728300","doi":"https://doi.org/10.23638/lmcs-16(1:9)2020","title":"Descriptive Complexity for Counting Complexity Classes","display_name":"Descriptive Complexity for Counting Complexity Classes","publication_year":2020,"publication_date":"2020-02-10","ids":{"openalex":"https://openalex.org/W2743728300","doi":"https://doi.org/10.23638/lmcs-16(1:9)2020","mag":"2743728300"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-16(1:9)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(1:9)2020","pdf_url":"https://lmcs.episciences.org/6079/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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/6079/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011691423","display_name":"Marcelo Arenas","orcid":"https://orcid.org/0000-0003-3678-1868"},"institutions":[{"id":"https://openalex.org/I162148367","display_name":"Pontificia Universidad Cat\u00f3lica de Chile","ror":"https://ror.org/04teye511","country_code":"CL","type":"education","lineage":["https://openalex.org/I162148367"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Marcelo Arenas","raw_affiliation_strings":["Pontificia Universidad Catlica de Chile & IMFD Chile San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pontificia Universidad Catlica de Chile & IMFD Chile San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany","institution_ids":["https://openalex.org/I162148367"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076747031","display_name":"Mart\u00edn Mu\u00f1oz","orcid":"https://orcid.org/0009-0003-3294-6159"},"institutions":[{"id":"https://openalex.org/I162148367","display_name":"Pontificia Universidad Cat\u00f3lica de Chile","ror":"https://ror.org/04teye511","country_code":"CL","type":"education","lineage":["https://openalex.org/I162148367"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Martin Mu\u00f1oz","raw_affiliation_strings":["Pontificia Universidad Catlica de Chile & IMFD Chile San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pontificia Universidad Catlica de Chile & IMFD Chile San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany","institution_ids":["https://openalex.org/I162148367"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083030983","display_name":"Cristian Riveros","orcid":"https://orcid.org/0000-0003-0832-116X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cristian Riveros","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0832-116X","affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7823,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7742963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"Volume 16, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9979000091552734,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9979000091552734,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11727","display_name":"Advanced Algebra and Logic","score":0.9950000047683716,"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/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.9122896194458008},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.7805777192115784},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.7321841716766357},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6807600855827332},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6668558120727539},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6321697235107422},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.5493724346160889},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5247155427932739},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5185378193855286},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5167188048362732},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.5009691715240479},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4902816116809845},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.48147478699684143},{"id":"https://openalex.org/keywords/ph","display_name":"PH","score":0.4360799789428711},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4332270622253418},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42730969190597534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3681068420410156},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.317710280418396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28825968503952026},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.08951354026794434}],"concepts":[{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.9122896194458008},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.7805777192115784},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.7321841716766357},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6807600855827332},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6668558120727539},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6321697235107422},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.5493724346160889},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5247155427932739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5185378193855286},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5167188048362732},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.5009691715240479},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4902816116809845},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.48147478699684143},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.4360799789428711},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4332270622253418},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42730969190597534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3681068420410156},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.317710280418396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28825968503952026},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.08951354026794434},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-16(1:9)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(1:9)2020","pdf_url":"https://lmcs.episciences.org/6079/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:1805.02724","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.02724","pdf_url":"https://arxiv.org/pdf/1805.02724","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1805.02724","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1805.02724","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-16(1:9)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(1:9)2020","pdf_url":"https://lmcs.episciences.org/6079/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","id":"https://metadata.un.org/sdg/16","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2743728300.pdf","grobid_xml":"https://content.openalex.org/works/W2743728300.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W59373101","https://openalex.org/W200507927","https://openalex.org/W1489366126","https://openalex.org/W1527197079","https://openalex.org/W1556751392","https://openalex.org/W1643571618","https://openalex.org/W1698854595","https://openalex.org/W1782691830","https://openalex.org/W1979759083","https://openalex.org/W1984509356","https://openalex.org/W1987205876","https://openalex.org/W1991188222","https://openalex.org/W1993180032","https://openalex.org/W2003895694","https://openalex.org/W2006912660","https://openalex.org/W2033647831","https://openalex.org/W2035744833","https://openalex.org/W2038225707","https://openalex.org/W2043360684","https://openalex.org/W2045916776","https://openalex.org/W2049316103","https://openalex.org/W2052582609","https://openalex.org/W2059442002","https://openalex.org/W2061042466","https://openalex.org/W2063981365","https://openalex.org/W2066720893","https://openalex.org/W2072181151","https://openalex.org/W2080370600","https://openalex.org/W2083553352","https://openalex.org/W2084392902","https://openalex.org/W2088094394","https://openalex.org/W2111302825","https://openalex.org/W2115826669","https://openalex.org/W2134054571","https://openalex.org/W2144706656","https://openalex.org/W2148352980","https://openalex.org/W2161611531","https://openalex.org/W2162372147","https://openalex.org/W2171280299","https://openalex.org/W2240520130","https://openalex.org/W2606244929","https://openalex.org/W2912579401","https://openalex.org/W2912962911","https://openalex.org/W2914562311","https://openalex.org/W2949894935","https://openalex.org/W2964237202","https://openalex.org/W3127113455"],"related_works":["https://openalex.org/W2374430960","https://openalex.org/W2327776271","https://openalex.org/W342214647","https://openalex.org/W2035152936","https://openalex.org/W2041069649","https://openalex.org/W1512399864","https://openalex.org/W2047754121","https://openalex.org/W1572916600","https://openalex.org/W1988772559","https://openalex.org/W2372260410"],"abstract_inverted_index":{"Descriptive":[0],"Complexity":[1],"has":[2,34],"been":[3,36],"very":[4],"successful":[5],"in":[6,13,19],"characterizing":[7],"complexity":[8,24,27,95,117,146],"classes":[9,96,118,147],"of":[10,15,85],"decision":[11,47],"problems":[12],"terms":[14],"the":[16,68],"properties":[17],"definable":[18],"some":[20,84],"logics.":[21],"However,":[22],"descriptive":[23],"for":[25],"counting":[26,94,116,145],"classes,":[28],"such":[29,97,148],"as":[30,43,45,98,149],"FP":[31],"and":[32,39,81,101,122,125,137],"#P,":[33,114],"not":[35,42],"systematically":[37],"studied,":[38],"it":[40],"is":[41],"developed":[44],"its":[46,86],"counterpart.":[48],"In":[49],"this":[50,62,140],"paper,":[51],"we":[52,71,132],"propose":[53],"a":[54,73,111],"framework":[55],"based":[56],"on":[57,67],"Weighted":[58],"Logics":[59,79],"to":[60,91,109,135],"address":[61],"issue.":[63],"Specifically,":[64],"by":[65],"focusing":[66],"natural":[69,128],"numbers":[70],"obtain":[72],"logic":[74],"called":[75],"Quantitative":[76],"Second":[77],"Order":[78],"(QSO),":[80],"show":[82,138],"how":[83,139],"fragments":[87],"can":[88],"be":[89],"used":[90],"capture":[92],"fundamental":[93],"FP,":[99],"#P":[100],"FPSPACE,":[102],"among":[103],"others.":[104],"We":[105],"also":[106],"use":[107],"QSO":[108],"define":[110],"hierarchy":[112],"inside":[113],"identifying":[115],"with":[119],"good":[120],"closure":[121],"approximation":[123],"properties,":[124],"which":[126],"admit":[127],"complete":[129],"problems.":[130],"Finally,":[131],"add":[133],"recursion":[134],"QSO,":[136],"extension":[141],"naturally":[142],"captures":[143],"lower":[144],"#L.":[150]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}