{"id":"https://openalex.org/W7126424374","doi":"https://doi.org/10.1145/3793666","title":"Cyclic Implicit Complexity","display_name":"Cyclic Implicit Complexity","publication_year":2026,"publication_date":"2026-01-31","ids":{"openalex":"https://openalex.org/W7126424374","doi":"https://doi.org/10.1145/3793666"},"language":"en","primary_location":{"id":"doi:10.1145/3793666","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3793666","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/A5007571235","display_name":"Gianluca Curzi","orcid":"https://orcid.org/0000-0001-8746-1704"},"institutions":[{"id":"https://openalex.org/I881427289","display_name":"University of Gothenburg","ror":"https://ror.org/01tm6cn81","country_code":"SE","type":"education","lineage":["https://openalex.org/I881427289"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Gianluca Curzi","raw_affiliation_strings":["Department of Philosophy, Linguistics and Theory of Science, University of Gothenburg, Gothenburg, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-8746-1704","affiliations":[{"raw_affiliation_string":"Department of Philosophy, Linguistics and Theory of Science, University of Gothenburg, Gothenburg, Sweden","institution_ids":["https://openalex.org/I881427289"]}]},{"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":["School of Computer Science, University of Birmingham, Birmingham, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-0142-3676","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"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":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17163197,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"27","issue":"2","first_page":"1","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.36070001125335693,"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/T10142","display_name":"Formal Methods in Verification","score":0.36070001125335693,"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/T10126","display_name":"Logic, programming, and type systems","score":0.2976999878883362,"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.11869999766349792,"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.8759999871253967},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6840000152587891},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.43630000948905945},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4253999888896942},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.4230000078678131},{"id":"https://openalex.org/keywords/bridge","display_name":"Bridge (graph theory)","score":0.40939998626708984},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.4081000089645386}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8759999871253967},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6840000152587891},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.623199999332428},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.43630000948905945},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4253999888896942},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.4230000078678131},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.40939998626708984},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3950999975204468},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.34700000286102295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3458000123500824},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.31209999322891235},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30880001187324524},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2754000127315521},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3793666","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3793666","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1505951678","https://openalex.org/W1556837122","https://openalex.org/W1560272532","https://openalex.org/W1568149704","https://openalex.org/W1970954854","https://openalex.org/W1999823887","https://openalex.org/W2013519208","https://openalex.org/W2053859260","https://openalex.org/W2057260190","https://openalex.org/W2069301430","https://openalex.org/W2071823993","https://openalex.org/W2467982476","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/W3003688551","https://openalex.org/W3118137278","https://openalex.org/W3183395447","https://openalex.org/W3204244705","https://openalex.org/W4252866964","https://openalex.org/W4311611284","https://openalex.org/W4412219441"],"related_works":[],"abstract_inverted_index":{"Circular":[0],"(or":[1],"cyclic":[2],")":[3],"proofs":[4,69],"have":[5,13,34],"received":[6],"increasing":[7],"attention":[8],"in":[9,126],"recent":[10],"years":[11],"and":[12,70,85,91,104],"been":[14,35],"proposed":[15],"as":[16],"an":[17],"alternative":[18],"setting":[19],"for":[20],"studying":[21],"(co)inductive":[22],"reasoning.":[23],"In":[24],"particular,":[25],"now":[26],"several":[27],"type":[28],"systems":[29],"based":[30,82],"on":[31,83],"circular":[32,47,68,79],"reasoning":[33],"proposed.":[36],"However,":[37],"little":[38],"is":[39],"known":[40],"about":[41],"the":[42,65,102,109],"complexity":[43,73],"theoretic":[44,115],"aspects":[45],"of":[46,55,118,124],"proofs,":[48],"which":[49],"exhibit":[50],"sophisticated":[51],"loop":[52],"structures":[53],"atypical":[54],"more":[56],"common":[57],"\u2018recursion":[58],"schemes\u2019.":[59],"This":[60],"article":[61],"attempts":[62],"to":[63,100],"bridge":[64],"gap":[66],"between":[67],"implicit":[71,116],"computational":[72],"(ICC).":[74],"Namely,":[75],"we":[76,92,111],"introduce":[77,112],"a":[78],"proof":[80,94],"system":[81],"Bellantoni":[84],"Cook\u2019s":[86],"famous":[87],"safe-normal":[88],"function":[89],"algebra,":[90],"identify":[93],"theoretical":[95],"constraints,":[96],"inspired":[97],"by":[98],"ICC,":[99],"characterise":[101],"polynomial-time":[103],"elementary":[105],"computable":[106],"functions.":[107],"Along":[108],"way,":[110],"new":[113],"recursion":[114],"characterisations":[117],"these":[119],"classes":[120],"that":[121],"may":[122],"be":[123],"interest":[125],"their":[127],"own":[128],"right.":[129]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-02T00:00:00"}