{"id":"https://openalex.org/W2774046057","doi":"https://doi.org/10.1215/00294527-2019-0031","title":"Short Proofs for Slow Consistency","display_name":"Short Proofs for Slow Consistency","publication_year":2019,"publication_date":"2019-11-29","ids":{"openalex":"https://openalex.org/W2774046057","doi":"https://doi.org/10.1215/00294527-2019-0031","mag":"2774046057"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-2019-0031","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2019-0031","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-61/issue-1/Short-Proofs-for-Slow-Consistency/10.1215/00294527-2019-0031.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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-61/issue-1/Short-Proofs-for-Slow-Consistency/10.1215/00294527-2019-0031.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Anton Freund","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anton Freund","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Fedor Pakhomov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fedor Pakhomov","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7673,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65603436,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"61","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.49129998683929443,"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"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.49129998683929443,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.17900000512599945,"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.09889999777078629,"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.7926999926567078},{"id":"https://openalex.org/keywords/peano-axioms","display_name":"Peano axioms","score":0.7918999791145325},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.6758000254631042},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.592199981212616},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4697999954223633},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43140000104904175},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.40869998931884766},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3621000051498413}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7926999926567078},{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.7918999791145325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7448999881744385},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.6758000254631042},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.592199981212616},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5313000082969666},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4697999954223633},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43140000104904175},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.40869998931884766},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3621000051498413},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.3411000072956085},{"id":"https://openalex.org/C122377713","wikidata":"https://www.wikidata.org/wiki/Q4422799","display_name":"Weak consistency","level":4,"score":0.3314000070095062},{"id":"https://openalex.org/C2776728590","wikidata":"https://www.wikidata.org/wiki/Q363948","display_name":"Contradiction","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C31388003","wikidata":"https://www.wikidata.org/wiki/Q7624548","display_name":"Strong consistency","level":3,"score":0.32109999656677246},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.2784999907016754},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.27399998903274536},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2685000002384186},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.25290000438690186},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1215/00294527-2019-0031","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2019-0031","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-61/issue-1/Short-Proofs-for-Slow-Consistency/10.1215/00294527-2019-0031.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:arXiv.org:1712.03251","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1712.03251","pdf_url":"https://arxiv.org/pdf/1712.03251","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1574996413","is_oa":false,"landing_page_url":"https://projecteuclid.org/euclid.ndjfl/1574996413","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"},{"id":"pmh:oai:archive.ugent.be:8735653","is_oa":false,"landing_page_url":"http://hdl.handle.net/1854/LU-8735653","pdf_url":null,"source":{"id":"https://openalex.org/S4306400478","display_name":"Ghent University Academic Bibliography (Ghent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I32597200","host_organization_name":"Ghent University","host_organization_lineage":["https://openalex.org/I32597200"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1939-0726","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1215/00294527-2019-0031","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-2019-0031","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-61/issue-1/Short-Proofs-for-Slow-Consistency/10.1215/00294527-2019-0031.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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2774046057.pdf","grobid_xml":"https://content.openalex.org/works/W2774046057.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1513644114","https://openalex.org/W1571003765","https://openalex.org/W1674402922","https://openalex.org/W1989844562","https://openalex.org/W2025460262","https://openalex.org/W2068743712","https://openalex.org/W2109720437","https://openalex.org/W2114374802","https://openalex.org/W2214792639","https://openalex.org/W2253714458","https://openalex.org/W2270032642","https://openalex.org/W2336574378","https://openalex.org/W2907713860","https://openalex.org/W2908059907","https://openalex.org/W2908250557","https://openalex.org/W2963187611","https://openalex.org/W3037940532","https://openalex.org/W4206512100"],"related_works":[],"abstract_inverted_index":{"Let":[0],"Con(T)\u21bex":[1],"denote":[2],"the":[3,30,33,39,51,64,85,106,109],"finite":[4,65],"consistency":[5,66,87,111,131],"statement":[6,88,112],"\u201cthere":[7],"are":[8,43],"no":[9],"proofs":[10,35,62,79],"of":[11,22,32,36,63,80,105,119,129,136],"contradiction":[12],"in":[13,38,48],"T":[14,41,57],"with":[15],"\u2264x":[16],"symbols.\u201d":[17],"For":[18],"a":[19,46,102],"large":[20],"class":[21],"natural":[23],"theories":[24],"T,":[25],"Pudl\u00e1k":[26],"has":[27,77],"shown":[28],"that":[29,56,73,108],"lengths":[31],"shortest":[34],"Con(T)\u21ben":[37],"theory":[40],"itself":[42],"bounded":[44],"by":[45,93],"polynomial":[47,61,78],"n.":[49],"At":[50],"same":[52],"time":[53],"he":[54],"conjectures":[55],"does":[58],"not":[59],"have":[60],"statements":[67],"Con(T+Con(T))\u21ben.":[68],"In":[69],"contrast,":[70],"we":[71],"show":[72],"Peano":[74,90],"arithmetic":[75],"(PA)":[76],"Con(PA+Con\u2217(PA))\u21ben,":[81],"where":[82],"Con\u2217(PA)":[83],"is":[84,114,124],"slow":[86,120,130],"for":[89],"arithmetic,":[91],"introduced":[92],"S.-D.":[94],"Friedman,":[95],"Rathjen,":[96],"and":[97],"Weiermann.":[98],"We":[99],"also":[100],"obtain":[101],"new":[103],"proof":[104],"result":[107],"usual":[110],"Con(PA)":[113],"equivalent":[115],"to":[116],"\u03b50":[117],"iterations":[118],"consistency.":[121],"Our":[122],"argument":[123],"proof-theoretic,":[125],"whereas":[126],"previous":[127],"investigations":[128],"relied":[132],"on":[133],"nonstandard":[134],"models":[135],"arithmetic.":[137]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2017-12-22T00:00:00"}