{"id":"https://openalex.org/W4252866964","doi":"https://doi.org/10.1109/lics.2017.8005114","title":"Equivalence of inductive definitions and cyclic proofs under arithmetic","display_name":"Equivalence of inductive definitions and cyclic proofs under arithmetic","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W4252866964","doi":"https://doi.org/10.1109/lics.2017.8005114"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-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/A5017026543","display_name":"Stefano Berardi","orcid":null},"institutions":[{"id":"https://openalex.org/I55143463","display_name":"University of Turin","ror":"https://ror.org/048tbm396","country_code":"IT","type":"education","lineage":["https://openalex.org/I55143463"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Stefano Berardi","raw_affiliation_strings":["Universita di Torino Torino, Italy"],"affiliations":[{"raw_affiliation_string":"Universita di Torino Torino, Italy","institution_ids":["https://openalex.org/I55143463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024163301","display_name":"Makoto Tatsuta","orcid":null},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Makoto Tatsuta","raw_affiliation_strings":["National Institute of Informatics/Sokendai, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"National Institute of Informatics/Sokendai, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017026543"],"corresponding_institution_ids":["https://openalex.org/I55143463"],"apc_list":null,"apc_paid":null,"fwci":1.1701,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.85129887,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"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.9990000128746033,"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.9990000128746033,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9958999752998352,"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.9958999752998352,"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/peano-axioms","display_name":"Peano axioms","score":0.7564787864685059},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7088218927383423},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6826679706573486},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5878546237945557},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5108906626701355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.509507954120636},{"id":"https://openalex.org/keywords/combinatorial-proof","display_name":"Combinatorial proof","score":0.4608317017555237},{"id":"https://openalex.org/keywords/mathematical-induction","display_name":"Mathematical induction","score":0.4510185718536377},{"id":"https://openalex.org/keywords/inductive-method","display_name":"Inductive method","score":0.43342962861061096},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.37279748916625977},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.34802645444869995}],"concepts":[{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.7564787864685059},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7088218927383423},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6826679706573486},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5878546237945557},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5108906626701355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.509507954120636},{"id":"https://openalex.org/C118539577","wikidata":"https://www.wikidata.org/wiki/Q3402784","display_name":"Combinatorial proof","level":2,"score":0.4608317017555237},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.4510185718536377},{"id":"https://openalex.org/C2993131915","wikidata":"https://www.wikidata.org/wiki/Q484511","display_name":"Inductive method","level":3,"score":0.43342962861061096},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.37279748916625977},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.34802645444869995},{"id":"https://openalex.org/C88610354","wikidata":"https://www.wikidata.org/wiki/Q1813494","display_name":"Teaching method","level":2,"score":0.0},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2017.8005114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/5","display_name":"Gender equality","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W32928793","https://openalex.org/W1506927614","https://openalex.org/W1556837122","https://openalex.org/W1983496086","https://openalex.org/W1999823887","https://openalex.org/W2095689360","https://openalex.org/W2120869910","https://openalex.org/W2131443763","https://openalex.org/W2611879577","https://openalex.org/W4248689402"],"related_works":["https://openalex.org/W2079125094","https://openalex.org/W1799042098","https://openalex.org/W2143088892","https://openalex.org/W3023460505","https://openalex.org/W2999935146","https://openalex.org/W2131793723","https://openalex.org/W182723225","https://openalex.org/W4309397387","https://openalex.org/W1507899410","https://openalex.org/W2123860315"],"abstract_inverted_index":{"A":[0],"cyclic":[1,154,163,172],"proof":[2,16,148,164,173],"system,":[3],"called":[4,42],"CLKID-omega,":[5],"gives":[6,195],"us":[7],"another":[8],"way":[9],"of":[10,29,34,38,129,134,149,203],"representing":[11],"inductive":[12,40,87],"definitions":[13],"and":[14,23,44,74,89,186],"efficient":[15],"search.":[17],"The":[18,127,191],"2011":[19],"paper":[20,71,106,110,131,136,157,219],"by":[21,72,107,137,169,199],"Brotherston":[22],"Simpson":[24,138],"showed":[25],"that":[26,112,133,177,222],"the":[27,32,35,46,51,61,84,96,124,135,162,171,181,187],"provability":[28,33],"CLKID-omega":[30],"includes":[31,132],"classical":[36],"system":[37],"Martin-Lof's":[39],"definitions,":[41],"LKID,":[43,168],"conjectured":[45],"equivalence.":[47],"By":[48],"this":[49,130,156,216,218],"year":[50],"equivalence":[52],"has":[53],"been":[54],"left":[55],"an":[56,201],"open":[57],"question.":[58],"In":[59,143,212],"general,":[60],"conjecture":[62,97,125],"was":[63,98],"proved":[64,99],"to":[65,82,93,100,117,145,209,214],"be":[66,101],"false":[67],"in":[68,103,161,167,178,228],"FoSSaCS":[69,104],"2017":[70,105],"Berardi":[73],"Tatsuta.":[75],"However,":[76],"if":[77,113],"we":[78,114],"restrict":[79],"both":[80,94,118],"systems":[81],"only":[83],"natural":[85],"number":[86],"predicate":[88],"add":[90,115],"Peano":[91,229],"arithmetic":[92,116],"systems,":[95,119],"true":[102],"Simpson.":[108],"This":[109],"shows":[111,158,221],"they":[120],"become":[121],"equivalent,":[122],"namely,":[123],"holds.":[126],"result":[128],"as":[139],"a":[140,147,152,184],"special":[141],"case.":[142],"order":[144,213],"construct":[146],"LKID":[150],"for":[151],"given":[153],"proof,":[155],"every":[159],"bud":[160],"is":[165,183,226],"provable":[166],"cutting":[170],"into":[174],"subproofs":[175],"such":[176],"each":[179],"subproof":[180],"conclusion":[182],"companion":[185],"assumptions":[188],"are":[189],"buds.":[190],"global":[192],"trace":[193],"condition":[194],"some":[196],"induction":[197,210],"principle,":[198],"using":[200],"extension":[202],"Podelski-Rybalchenko":[204],"termination":[205],"theorem":[206,225],"from":[207],"well-foundedness":[208],"schema.":[211],"prove":[215],"extension,":[217],"also":[220],"infinite":[223],"Ramsey":[224],"formalizable":[227],"arithmetic.":[230]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}