{"id":"https://openalex.org/W3204244705","doi":"https://doi.org/10.1145/3531130.3533340","title":"Cyclic Implicit Complexity","display_name":"Cyclic Implicit Complexity","publication_year":2022,"publication_date":"2022-08-02","ids":{"openalex":"https://openalex.org/W3204244705","doi":"https://doi.org/10.1145/3531130.3533340","mag":"3204244705"},"language":"en","primary_location":{"id":"doi:10.1145/3531130.3533340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3531130.3533340","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":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure-oai.bham.ac.uk/ws/files/306492896/CurziG2026Cyclic.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007571235","display_name":"Gianluca Curzi","orcid":"https://orcid.org/0000-0001-8746-1704"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gianluca Curzi","raw_affiliation_strings":["University of Birmingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089810498","display_name":"Anupam Das","orcid":"https://orcid.org/0000-0002-0142-3676"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Anupam Das","raw_affiliation_strings":["University of Birmingham, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4163,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66281426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9984999895095825,"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.9984999895095825,"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/T10126","display_name":"Logic, programming, and type systems","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/T10142","display_name":"Formal Methods in Verification","score":0.9943000078201294,"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/mathematical-proof","display_name":"Mathematical proof","score":0.8750106692314148},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7737956047058105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5590980052947998},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46416905522346497},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.41926804184913635},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.4152151346206665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4015711545944214},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3217906355857849},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3081473708152771},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2086699903011322},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11638355255126953},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08360669016838074}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8750106692314148},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7737956047058105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5590980052947998},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46416905522346497},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.41926804184913635},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4152151346206665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4015711545944214},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3217906355857849},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3081473708152771},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2086699903011322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11638355255126953},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08360669016838074},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3531130.3533340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3531130.3533340","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:pure.atira.dk:openaire_cris_publications/5ff00538-fdac-4e66-b082-d70326eba5d6","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/5ff00538-fdac-4e66-b082-d70326eba5d6","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/306492896/CurziG2026Cyclic.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Curzi, G & Das, A 2026, 'Cyclic Implicit Complexity', ACM Transactions on Computational Logic, vol. 27, no. 2, 11. https://doi.org/10.1145/3793666","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/bb6d3fb8-911c-489e-8ce0-5f4c52c2b151","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/bb6d3fb8-911c-489e-8ce0-5f4c52c2b151","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Curzi , G & Das , A 2022 , Cyclic Implicit Complexity . in C Baier (ed.) , LICS '22 : Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science . , 19 , LICS: Logic in Computer Science , Association for Computing Machinery (ACM) , 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022 , Haifa , Israel , 2/08/22 . https://doi.org/10.1145/3531130.3533340","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/9442b633-dc06-4207-9bf4-13e8cb666c8a","is_oa":true,"landing_page_url":"https://birmingham.elsevierpure.com/en/publications/9442b633-dc06-4207-9bf4-13e8cb666c8a","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/5ff00538-fdac-4e66-b082-d70326eba5d6","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/5ff00538-fdac-4e66-b082-d70326eba5d6","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/306492896/CurziG2026Cyclic.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Curzi, G & Das, A 2026, 'Cyclic Implicit Complexity', ACM Transactions on Computational Logic, vol. 27, no. 2, 11. https://doi.org/10.1145/3793666","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8996976171","display_name":null,"funder_award_id":"MR/S035540/1","funder_id":"https://openalex.org/F4320314731","funder_display_name":"UK Research and Innovation"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3204244705.pdf","grobid_xml":"https://content.openalex.org/works/W3204244705.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1539014","https://openalex.org/W1483568252","https://openalex.org/W1505951678","https://openalex.org/W1520244229","https://openalex.org/W1556837122","https://openalex.org/W1560272532","https://openalex.org/W1568149704","https://openalex.org/W1579247651","https://openalex.org/W1957081287","https://openalex.org/W1970954854","https://openalex.org/W1999823887","https://openalex.org/W2013519208","https://openalex.org/W2041688914","https://openalex.org/W2053859260","https://openalex.org/W2057260190","https://openalex.org/W2069301430","https://openalex.org/W2071823993","https://openalex.org/W2231425046","https://openalex.org/W2467982476","https://openalex.org/W2500618074","https://openalex.org/W2553042017","https://openalex.org/W2611879577","https://openalex.org/W2726021294","https://openalex.org/W2810916103","https://openalex.org/W2945500475","https://openalex.org/W2953665898","https://openalex.org/W2953934790","https://openalex.org/W2996961130","https://openalex.org/W3003688551","https://openalex.org/W3118137278","https://openalex.org/W3183395447","https://openalex.org/W4252866964","https://openalex.org/W6948101348"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W2125274893"],"abstract_inverted_index":{"Circular":[0],"(or":[1],"cyclic)":[2],"proofs":[3],"have":[4,12,33],"received":[5],"increasing":[6],"attention":[7],"in":[8],"recent":[9],"years,":[10],"and":[11],"been":[13,34],"proposed":[14],"as":[15],"an":[16],"alternative":[17],"setting":[18],"for":[19],"studying":[20],"(co)inductive":[21],"reasoning.":[22],"In":[23],"particular,":[24],"now":[25],"several":[26],"type":[27],"systems":[28],"based":[29],"on":[30],"circular":[31,46],"reasoning":[32],"proposed.":[35],"However,":[36],"little":[37],"is":[38],"known":[39],"about":[40],"the":[41],"complexity":[42],"theoretic":[43],"aspects":[44],"of":[45,54],"proofs,":[47],"which":[48],"exhibit":[49],"sophisticated":[50],"loop":[51],"structures":[52],"atypical":[53],"more":[55],"common":[56],"\u2018recursion":[57],"schemes\u2019.":[58]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}