{"id":"https://openalex.org/W1999823887","doi":"https://doi.org/10.1093/logcom/exq052","title":"Sequent calculi for induction and infinite descent","display_name":"Sequent calculi for induction and infinite descent","publication_year":2010,"publication_date":"2010-09-30","ids":{"openalex":"https://openalex.org/W1999823887","doi":"https://doi.org/10.1093/logcom/exq052","mag":"1999823887"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exq052","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exq052","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.pure.ed.ac.uk/ws/files/12304236/bs_journal.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025368137","display_name":"J G. Brotherston","orcid":"https://orcid.org/0000-0002-7536-4496"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"J. Brotherston","raw_affiliation_strings":["Department of Computing, Imperial College London, London, UK.E-mail: j.brotherston@imperial.ac.uk","Department of Computing, Imperial College London, London, UK.E-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, London, UK.E-mail: j.brotherston@imperial.ac.uk","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Department of Computing, Imperial College London, London, UK.E-mail:","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110256373","display_name":"Alex Simpson","orcid":null},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. Simpson","raw_affiliation_strings":["Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, Edinburgh, UK.E-mail: alex.simpson@ed.ac.uk","Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, Edinburgh, UK.E-mail:"],"affiliations":[{"raw_affiliation_string":"Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, Edinburgh, UK.E-mail: alex.simpson@ed.ac.uk","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, Edinburgh, UK.E-mail:","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025368137"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":2.7983,"has_fulltext":true,"cited_by_count":125,"citation_normalized_percentile":{"value":0.90845499,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"21","issue":"6","first_page":"1177","last_page":"1216"},"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.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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.9952999949455261,"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.8270694613456726},{"id":"https://openalex.org/keywords/sequent","display_name":"Sequent","score":0.6956555247306824},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.6604959964752197},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.6287996768951416},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.6239854693412781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6239662170410156},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.6185702681541443},{"id":"https://openalex.org/keywords/mathematical-induction","display_name":"Mathematical induction","score":0.529133677482605},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.4941459000110626},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.47891223430633545},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47772547602653503},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.45976561307907104},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.43179967999458313},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.4314863979816437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2936566472053528},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10638129711151123},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.07914328575134277}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8270694613456726},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.6956555247306824},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.6604959964752197},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.6287996768951416},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6239854693412781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6239662170410156},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.6185702681541443},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.529133677482605},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.4941459000110626},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.47891223430633545},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47772547602653503},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.45976561307907104},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.43179967999458313},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.4314863979816437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2936566472053528},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10638129711151123},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.07914328575134277},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1093/logcom/exq052","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exq052","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/64c98914-e382-468f-b888-fedc2ef0af16","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/64c98914-e382-468f-b888-fedc2ef0af16","pdf_url":"https://www.pure.ed.ac.uk/ws/files/12304236/bs_journal.pdf","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1363359","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1363359/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"   JOURNAL OF LOGIC AND COMPUTATION , 21  (6)   pp. 1177-1216.   (2011)      ","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:publications/64c98914-e382-468f-b888-fedc2ef0af16","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/64c98914-e382-468f-b888-fedc2ef0af16","pdf_url":"https://www.pure.ed.ac.uk/ws/files/12304236/bs_journal.pdf","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1361938442","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4546728733","display_name":null,"funder_award_id":"EP/F043767/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320335041","display_name":"School of Informatics, University of Edinburgh","ror":"https://ror.org/01nrxwf90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1999823887.pdf","grobid_xml":"https://content.openalex.org/works/W1999823887.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W406170251","https://openalex.org/W1266442129","https://openalex.org/W1482532876","https://openalex.org/W1483737907","https://openalex.org/W1505191296","https://openalex.org/W1545803195","https://openalex.org/W1556705528","https://openalex.org/W1556837122","https://openalex.org/W1560050980","https://openalex.org/W1568149704","https://openalex.org/W1575501012","https://openalex.org/W1585533089","https://openalex.org/W1587799979","https://openalex.org/W1588723084","https://openalex.org/W1602067282","https://openalex.org/W1949275316","https://openalex.org/W1969682671","https://openalex.org/W1983496086","https://openalex.org/W1988449272","https://openalex.org/W1993129359","https://openalex.org/W2000451268","https://openalex.org/W2015640848","https://openalex.org/W2026224392","https://openalex.org/W2029129011","https://openalex.org/W2039977878","https://openalex.org/W2054834413","https://openalex.org/W2056022747","https://openalex.org/W2068769696","https://openalex.org/W2068793017","https://openalex.org/W2081019971","https://openalex.org/W2081909835","https://openalex.org/W2120869910","https://openalex.org/W2122276128","https://openalex.org/W2123056643","https://openalex.org/W2132750992","https://openalex.org/W2141287679","https://openalex.org/W2147215127","https://openalex.org/W2149837936","https://openalex.org/W2153364044","https://openalex.org/W2158624842","https://openalex.org/W2158738638","https://openalex.org/W2160331299","https://openalex.org/W2163602379","https://openalex.org/W2166989203","https://openalex.org/W2263967233","https://openalex.org/W2467982476","https://openalex.org/W2744169538","https://openalex.org/W2977904728"],"related_works":["https://openalex.org/W4294629469","https://openalex.org/W102468273","https://openalex.org/W2396504352","https://openalex.org/W1856383708","https://openalex.org/W2954476089","https://openalex.org/W2918427073","https://openalex.org/W2793983771","https://openalex.org/W3003438657","https://openalex.org/W2911183586","https://openalex.org/W2806893870"],"abstract_inverted_index":{"This":[0],"article":[1],"formalizes":[2],"and":[3,100,126,177,181],"compares":[4],"two":[5],"different":[6],"styles":[7],"of":[8,47,61,66,131],"reasoning":[9],"with":[10,33,55,121],"inductively":[11,41,93],"defined":[12,42,94],"predicates,":[13],"each":[14],"style":[15],"being":[16],"encapsulated":[17],"by":[18,31,83,151,159,190,197],"a":[19,58,70,145],"corresponding":[20],"sequent":[21],"calculus":[22],"proof":[23,30,106,172,189,196],"system.The":[24],"first":[25],"system,":[26,74,88,173],"LKID,":[27,176],"supports":[28],"traditional":[29],"induction,":[32],"induction":[34,191],"rules":[35,38,91],"formulated":[36],"as":[37,69],"for":[39,92,139],"introducing":[40],"predicates":[43,95],"on":[44,105],"the":[45,64,89,129],"left":[46],"sequents.We":[48],"show":[49,115],"LKID":[50,182],"to":[51,57,80,112,117,123,148,155,194],"be":[52,118],"cut-free":[53,119],"complete":[54,120],"respect":[56,122],"natural":[59,146],"class":[60],"Henkin":[62],"models;":[63],"eliminability":[65,130],"cut":[67],"follows":[68],"corollary.":[71],"The":[72,133],"second":[73],"LKID\u03c9,":[75],"uses":[76],"infinite":[77,84,198],"(non-well-founded)":[78],"proofs":[79,149,157],"represent":[81],"arguments":[82],"descent.":[85,199],"In":[86],"this":[87,169],"left-introduction":[90],"are":[96,183],"simple":[97],"case-split":[98],"rules,":[99],"an":[101],"infinitary,":[102],"global":[103],"condition":[104],"trees":[107],"is":[108,137,163,192],"required":[109],"in":[110,184],"order":[111],"ensure":[113],"soundness.We":[114],"LKID\u03c9":[116,136],"standard":[124],"models,":[125],"again":[127],"infer":[128],"cut.":[132],"infinitary":[134],"system":[135],"unsuitable":[138],"formal":[140],"reasoning.":[141],"However,":[142],"it":[143],"has":[144],"restriction":[147],"given":[150],"regular":[152,195],"trees,":[153],"i.e.":[154,187],"those":[156],"representable":[158],"finite":[160],"graphs,":[161],"which":[162],"so":[164],"suited.":[165],"We":[166],"demonstrate":[167],"that":[168,179,188],"restricted":[170],"\u2018cyclic\u2019":[171],"CLKID\u03c9,":[174],"subsumes":[175],"conjecture":[178],"CLKID\u03c9":[180],"fact":[185],"equivalent,":[186],"equivalent":[193]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}