{"id":"https://openalex.org/W2090521688","doi":"https://doi.org/10.1215/00294527-1715716","title":"Primitive Recursion and the Chain Antichain Principle","display_name":"Primitive Recursion and the Chain Antichain Principle","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2090521688","doi":"https://doi.org/10.1215/00294527-1715716","mag":"2090521688"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-1715716","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1715716","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-2/Primitive-Recursion-and-the-Chain-Antichain-Principle/10.1215/00294527-1715716.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-2/Primitive-Recursion-and-the-Chain-Antichain-Principle/10.1215/00294527-1715716.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080684787","display_name":"Alexander Kreuzer","orcid":"https://orcid.org/0000-0002-2352-3547"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander P. Kreuzer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080684787"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0876,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87454849,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"53","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T13400","display_name":"Mathematical and Theoretical Analysis","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9922000169754028,"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/antichain","display_name":"Antichain","score":0.7908828854560852},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7110810875892639},{"id":"https://openalex.org/keywords/finitary","display_name":"Finitary","score":0.6807067394256592},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5266993641853333},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.50006103515625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43051815032958984},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.42374375462532043},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.2801969051361084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13479313254356384}],"concepts":[{"id":"https://openalex.org/C136134351","wikidata":"https://www.wikidata.org/wiki/Q431937","display_name":"Antichain","level":3,"score":0.7908828854560852},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7110810875892639},{"id":"https://openalex.org/C2778003309","wikidata":"https://www.wikidata.org/wiki/Q5450381","display_name":"Finitary","level":2,"score":0.6807067394256592},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5266993641853333},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.50006103515625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43051815032958984},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.42374375462532043},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.2801969051361084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13479313254356384},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1215/00294527-1715716","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1715716","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-2/Primitive-Recursion-and-the-Chain-Antichain-Principle/10.1215/00294527-1715716.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1336588253","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1336588253","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1215/00294527-1715716","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1715716","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-2/Primitive-Recursion-and-the-Chain-Antichain-Principle/10.1215/00294527-1715716.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G762232396","display_name":null,"funder_award_id":"Project","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2090521688.pdf","grobid_xml":"https://content.openalex.org/works/W2090521688.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W561202933","https://openalex.org/W573758957","https://openalex.org/W1493890316","https://openalex.org/W1495615244","https://openalex.org/W1512973490","https://openalex.org/W1602168979","https://openalex.org/W1973185693","https://openalex.org/W2001283416","https://openalex.org/W2004219814","https://openalex.org/W2028602249","https://openalex.org/W2030975201","https://openalex.org/W2037300268","https://openalex.org/W2069207426","https://openalex.org/W2072032541","https://openalex.org/W2072085302","https://openalex.org/W2144268026","https://openalex.org/W2148962283","https://openalex.org/W2509025323","https://openalex.org/W2603470071","https://openalex.org/W2949253467","https://openalex.org/W3124326917","https://openalex.org/W4229690001"],"related_works":["https://openalex.org/W2976590292","https://openalex.org/W4288102793","https://openalex.org/W4206837156","https://openalex.org/W2975654559","https://openalex.org/W2085314983","https://openalex.org/W2017288906","https://openalex.org/W3110583286","https://openalex.org/W4287587103","https://openalex.org/W2125274893","https://openalex.org/W4311644574"],"abstract_inverted_index":{"Let":[0],"the":[1,7,63,112,152],"chain":[2,18],"antichain":[3],"principle":[4,130],"(CAC)":[5],"be":[6],"statement":[8,64],"that":[9,36,46,65,89,96,119],"each":[10],"partial":[11],"order":[12],"on":[13],"$\\mathbb{N}$":[14],"possesses":[15],"an":[16,20],"infinite":[17,21],"or":[19],"antichain.":[22],"Chong,":[23],"Slaman,":[24],"and":[25,42,59,95],"Yang":[26],"recently":[27],"proved":[28],"using":[29,79],"forcing":[30],"over":[31,40,93],"nonstandard":[32],"models":[33],"of":[34,62,82,86,114,122],"arithmetic":[35],"CAC":[37,47,66,117],"is":[38,91,109,131],"$\\Pi^1_1$-conservative":[39],"$\\text{RCA}_0+\\Pi^0_1\\text{-CP}$":[41],"so":[43],"in":[44,111,134],"particular":[45],"does":[48,71],"not":[49,72],"imply":[50,73],"$\\Sigma^0_2$-induction.":[51,74],"We":[52,149],"provide":[53],"here":[54],"a":[55,80,125],"different":[56],"purely":[57],"syntactical":[58],"constructive":[60],"proof":[61,108],"(even":[67],"together":[68,156],"with":[69,157],"WKL)":[70],"In":[75],"detail":[76],"we":[77],"show":[78],"refinement":[81],"Howard's":[83],"ordinal":[84],"analysis":[85],"bar":[87],"recursion":[88],"$\\text{WKL}_0^\\omega+\\text{CAC}$":[90],"$\\Pi^0_2$-conservative":[92],"PRA":[94],"one":[97],"can":[98],"extract":[99,142],"primitive":[100,143],"recursive":[101,144],"realizers":[102],"for":[103],"such":[104,147],"statements.":[105],"Moreover,":[106],"our":[107],"finitary":[110],"sense":[113],"Hilbert's":[115],"program.":[116],"implies":[118],"every":[120],"sequence":[121],"$\\mathbb{R}$":[123],"has":[124],"monotone":[126],"subsequence.":[127],"This":[128],"Bolzano-Weierstra\u00df}-like":[129],"commonly":[132],"used":[133],"proofs.":[135,148],"Our":[136],"result":[137],"makes":[138],"it":[139],"possible":[140],"to":[141,160],"terms":[145],"from":[146],"also":[150],"discuss":[151],"Erd\u0151s-Moser":[153],"principle,":[154],"which\u2014taken":[155],"CAC\u2014is":[158],"equivalent":[159],"$\\text{RT}^2_2$.":[161]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}