{"id":"https://openalex.org/W4415850035","doi":"https://doi.org/10.46298/lmcs-21(4:18)2025","title":"Computational expressivity of (circular) proofs with fixed points","display_name":"Computational expressivity of (circular) proofs with fixed points","publication_year":2025,"publication_date":"2025-11-04","ids":{"openalex":"https://openalex.org/W4415850035","doi":"https://doi.org/10.46298/lmcs-21(4:18)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:18)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:18)2025","pdf_url":"https://lmcs.episciences.org/16846/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":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16846/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007571235","display_name":"Gianluca Curzi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gianluca Curzi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089810498","display_name":"Anupam Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anupam Das","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007571235"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17402804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","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.6865000128746033,"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.6865000128746033,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.2061000019311905,"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.02199999988079071,"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/fixed-point","display_name":"Fixed point","score":0.7008000016212463},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.694100022315979},{"id":"https://openalex.org/keywords/least-fixed-point","display_name":"Least fixed point","score":0.6543999910354614},{"id":"https://openalex.org/keywords/peano-axioms","display_name":"Peano axioms","score":0.6492999792098999},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.5389999747276306},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.5117999911308289},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.5},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.4684999883174896},{"id":"https://openalex.org/keywords/conservative-extension","display_name":"Conservative extension","score":0.43619999289512634},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.43549999594688416}],"concepts":[{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.7008000016212463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6970999836921692},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.694100022315979},{"id":"https://openalex.org/C27333817","wikidata":"https://www.wikidata.org/wiki/Q6134913","display_name":"Least fixed point","level":5,"score":0.6543999910354614},{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.6492999792098999},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.5389999747276306},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5138999819755554},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.5117999911308289},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.5},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.4684999883174896},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.43619999289512634},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.43549999594688416},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.4140999913215637},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4077000021934509},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.39750000834465027},{"id":"https://openalex.org/C65148605","wikidata":"https://www.wikidata.org/wiki/Q7442973","display_name":"Second-order arithmetic","level":3,"score":0.38510000705718994},{"id":"https://openalex.org/C111404639","wikidata":"https://www.wikidata.org/wiki/Q376166","display_name":"Cut-elimination theorem","level":4,"score":0.3765999972820282},{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.3675000071525574},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.3537999987602234},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3499000072479248},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C173125200","wikidata":"https://www.wikidata.org/wiki/Q5275729","display_name":"Modal \u03bc-calculus","level":5,"score":0.32170000672340393},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3107999861240387},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.2962000072002411},{"id":"https://openalex.org/C6489637","wikidata":"https://www.wikidata.org/wiki/Q7250002","display_name":"Proof calculus","level":3,"score":0.2915000021457672},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-21(4:18)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:18)2025","pdf_url":"https://lmcs.episciences.org/16846/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:pure.atira.dk:openaire/69020867-9702-40f9-83f6-a3f06979a225","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/69020867-9702-40f9-83f6-a3f06979a225","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Curzi, G & Das, A 2025, 'Computational expressivity of (circular) proofs with fixed points', Logical Methods in Computer Science, vol. 21, no. 4, 18, pp. 18:1-18:58. https://doi.org/10.46298/lmcs-21(4:18)2025","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:18)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:18)2025","pdf_url":"https://lmcs.episciences.org/16846/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":[],"awards":[],"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/W4415850035.pdf","grobid_xml":"https://content.openalex.org/works/W4415850035.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,16],"study":[1],"the":[2,13,38,63,78,87,105,108,119,150,185,192,201],"computational":[3,109],"expressivity":[4],"of":[5,74,81,86,111,130],"proof":[6,113],"systems":[7,114],"with":[8,18,115,169],"fixed":[9,34,116,134,170,203],"point":[10,204],"operators,":[11],"within":[12,179],"'proofs-as-programs'":[14],"paradigm.":[15],"start":[17],"a":[19,43,47,72,124,155,163],"calculus":[20,49],"muLJ":[21,41,59],"(due":[22,97,146],"to":[23,46,98,140,144,147,161,183],"Clairambault)":[24],"that":[25,136],"extends":[26],"intuitionistic":[27],"logic":[28],"by":[29,133],"least":[30],"and":[31,60,84],"greatest":[32],"positive":[33],"points.":[35,117,171],"Based":[36],"in":[37,70,104,159,181],"sequent":[39],"calculus,":[40],"admits":[42],"standard":[44],"extension":[45,129],"'circular'":[48],"CmuLJ.":[50],"Our":[51],"main":[52],"result":[53],"is":[54],"that,":[55],"perhaps":[56],"surprisingly,":[57],"both":[58],"CmuLJ":[61],"represent":[62],"same":[64],"first-order":[65],"functions:":[66],"those":[67],"provably":[68],"total":[69],"$\u03a0^1_2$-$\\mathsf{CA}_0$,":[71],"subsystem":[73],"second-order":[75],"arithmetic":[76],"beyond":[77],"'big":[79],"five'":[80],"reverse":[82,198],"mathematics":[83,199],"one":[85],"strongest":[88],"theories":[89],"for":[90,166,200],"which":[91],"we":[92,122,153,174,188,194],"have":[93],"an":[94,128],"ordinal":[95],"analysis":[96],"Rathjen).":[99],"This":[100],"solves":[101],"various":[102],"questions":[103],"literature":[106],"on":[107],"strength":[110],"(circular)":[112],"For":[118,149],"lower":[120],"bound":[121,152],"give":[123,162],"realisability":[125],"interpretation":[126],"from":[127],"Peano":[131],"Arithmetic":[132],"points":[135],"has":[137],"been":[138],"shown":[139],"be":[141],"arithmetically":[142],"equivalent":[143],"$\u03a0^1_2$-$\\mathsf{CA}_0$":[145,180],"M\u00f6llerfeld).":[148],"upper":[151],"construct":[154],"novel":[156,197],"computability":[157],"model":[158],"order":[160,182],"totality":[164],"argument":[165,177],"circular":[167],"proofs":[168],"In":[172],"fact":[173],"formalise":[175],"this":[176],"itself":[178],"obtain":[184],"tight":[186],"bounds":[187],"are":[189],"after.":[190],"Along":[191],"way":[193],"develop":[195],"some":[196],"Knaster-Tarski":[202],"theorem.":[205]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-11-04T00:00:00"}