{"id":"https://openalex.org/W2563354002","doi":"https://doi.org/10.1093/logcom/exv058","title":"An analysis of the Podelski\u2013Rybalchenko termination theorem via bar recursion","display_name":"An analysis of the Podelski\u2013Rybalchenko termination theorem via bar recursion","publication_year":2015,"publication_date":"2015-08-29","ids":{"openalex":"https://openalex.org/W2563354002","doi":"https://doi.org/10.1093/logcom/exv058","mag":"2563354002"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exv058","is_oa":true,"landing_page_url":"https://doi.org/10.1093/logcom/exv058","pdf_url":"https://academic.oup.com/logcom/article-pdf/29/4/555/28917413/exv058.pdf","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":"bronze","oa_url":"https://academic.oup.com/logcom/article-pdf/29/4/555/28917413/exv058.pdf","any_repository_has_fulltext":true},"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":["Universit\u00e0 degli studi di Torino"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli studi di Torino","institution_ids":["https://openalex.org/I55143463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084236771","display_name":"Paulo Oliva","orcid":"https://orcid.org/0000-0002-0492-4855"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paulo Oliva","raw_affiliation_strings":["Queen Mary University of London"],"affiliations":[{"raw_affiliation_string":"Queen Mary University of London","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088949609","display_name":"Silvia Steila","orcid":"https://orcid.org/0000-0003-0394-1204"},"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":false,"raw_author_name":"Silvia Steila","raw_affiliation_strings":["Universit\u00e0 degli studi di Torino"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli studi di Torino","institution_ids":["https://openalex.org/I55143463"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017026543"],"corresponding_institution_ids":["https://openalex.org/I55143463"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.701,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76242256,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"4","first_page":"555","last_page":"575"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9970999956130981,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.881153404712677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6320444345474243},{"id":"https://openalex.org/keywords/bar","display_name":"Bar (unit)","score":0.6260899901390076},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5388872623443604},{"id":"https://openalex.org/keywords/moduli","display_name":"Moduli","score":0.5302350521087646},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48420217633247375},{"id":"https://openalex.org/keywords/modulus","display_name":"Modulus","score":0.43887633085250854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3965466320514679},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.368995726108551},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15098440647125244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14406698942184448},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09775617718696594},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08232063055038452}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.881153404712677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6320444345474243},{"id":"https://openalex.org/C188721877","wikidata":"https://www.wikidata.org/wiki/Q103510","display_name":"Bar (unit)","level":2,"score":0.6260899901390076},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5388872623443604},{"id":"https://openalex.org/C121089165","wikidata":"https://www.wikidata.org/wiki/Q6889796","display_name":"Moduli","level":2,"score":0.5302350521087646},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48420217633247375},{"id":"https://openalex.org/C193867417","wikidata":"https://www.wikidata.org/wiki/Q6889814","display_name":"Modulus","level":2,"score":0.43887633085250854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3965466320514679},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.368995726108551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15098440647125244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14406698942184448},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09775617718696594},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08232063055038452},{"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/C153294291","wikidata":"https://www.wikidata.org/wiki/Q25261","display_name":"Meteorology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1093/logcom/exv058","is_oa":true,"landing_page_url":"https://doi.org/10.1093/logcom/exv058","pdf_url":"https://academic.oup.com/logcom/article-pdf/29/4/555/28917413/exv058.pdf","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:iris.unito.it:2318/1526156","is_oa":true,"landing_page_url":"http://hdl.handle.net/2318/1526156","pdf_url":"http://hdl.handle.net/2318/1526156","source":{"id":"https://openalex.org/S4306400637","display_name":"Institutional Research Information System University of Turin (University of Turin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I55143463","host_organization_name":"University of Turin","host_organization_lineage":["https://openalex.org/I55143463"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:qmro.qmul.ac.uk:123456789/31913","is_oa":false,"landing_page_url":"http://qmro.qmul.ac.uk/xmlui/handle/123456789/31913","pdf_url":null,"source":{"id":"https://openalex.org/S4306400530","display_name":"Queen Mary Research Online (Queen Mary University of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I166337079","host_organization_name":"Queen Mary University of London","host_organization_lineage":["https://openalex.org/I166337079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1093/logcom/exv058","is_oa":true,"landing_page_url":"https://doi.org/10.1093/logcom/exv058","pdf_url":"https://academic.oup.com/logcom/article-pdf/29/4/555/28917413/exv058.pdf","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"},"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2563354002.pdf","grobid_xml":"https://content.openalex.org/works/W2563354002.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W561202933","https://openalex.org/W1525431708","https://openalex.org/W1965352021","https://openalex.org/W1995130513","https://openalex.org/W2028602249","https://openalex.org/W2048835253","https://openalex.org/W2095689360","https://openalex.org/W2106315319","https://openalex.org/W2130233653","https://openalex.org/W2170105957","https://openalex.org/W2328120109","https://openalex.org/W2798718690","https://openalex.org/W2911635509","https://openalex.org/W6696653377","https://openalex.org/W6701590085","https://openalex.org/W6758708581"],"related_works":["https://openalex.org/W1976679120","https://openalex.org/W2377519369","https://openalex.org/W3202311233","https://openalex.org/W4281614748","https://openalex.org/W32024214","https://openalex.org/W2765883196","https://openalex.org/W2034826746","https://openalex.org/W2396919090","https://openalex.org/W2379816237","https://openalex.org/W2032164205"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"an":[3],"effective":[4],"proof":[5],"(with":[6],"explicit":[7],"bounds)":[8],"of":[9,23,29,32,56,64,72,95],"the":[10,27,30,41,67,76],"Podelski":[11],"and":[12],"Rybalchenko":[13],"Termination":[14],"Theorem.":[15],"The":[16,47],"sub-recursive":[17],"bounds":[18],"we":[19],"obtain":[20],"make":[21],"use":[22],"bar":[24,98],"recursion,":[25],"in":[26,80,89],"form":[28],"product":[31],"selection":[33],"functions,":[34],"as":[35,52],"this":[36,84],"is":[37,86],"used":[38],"to":[39],"interpret":[40],"Weak":[42],"Ramsey":[43],"Theorem":[44],"for":[45,58,66],"pairs.":[46],"construction":[48],"can":[49],"be":[50],"seen":[51],"calculating":[53],"a":[54,59,93],"modulus":[55,85],"well-foundedness":[57,65],"given":[60,62],"program":[61],"moduli":[63,78],"disjunctively":[68],"well-founded":[69],"finite":[70],"set":[71],"covering":[73],"relations.":[74],"When":[75],"input":[77],"are":[79],"system":[81,90],"T":[82,91],",":[83],"also":[87],"definable":[88],"by":[92],"result":[94],"Schwichtenberg":[96],"on":[97],"recursion.":[99]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2017-01-06T00:00:00"}