{"id":"https://openalex.org/W2112512535","doi":"https://doi.org/10.1145/1183278.1183283","title":"The strength of replacement in weak arithmetic","display_name":"The strength of replacement in weak arithmetic","publication_year":2006,"publication_date":"2006-10-01","ids":{"openalex":"https://openalex.org/W2112512535","doi":"https://doi.org/10.1145/1183278.1183283","mag":"2112512535"},"language":"en","primary_location":{"id":"doi:10.1145/1183278.1183283","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1183278.1183283","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-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/A5034555443","display_name":"Stephen Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephen Cook","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Ont., Canada","Department of Computer Science, University of Toronto, Toronto, Ont. (Canada)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ont., Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ont. (Canada)","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007592654","display_name":"Neil Thapen","orcid":"https://orcid.org/0000-0001-9734-5029"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Neil Thapen","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Ont., Canada","Department of Computer Science, University of Toronto, Toronto, Ont. (Canada)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ont., Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ont. (Canada)","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":2.6619,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.90054925,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"7","issue":"4","first_page":"749","last_page":"764"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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.9975000023841858,"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.9944999814033508,"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/mathematics","display_name":"Mathematics","score":0.8127568960189819},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6452133655548096},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5882574915885925},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5773168802261353},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5012598037719727},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49665457010269165},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4947895407676697},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4710421860218048},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46634572744369507},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.4501190781593323},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.42056265473365784},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.41852864623069763},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2692530155181885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06244403123855591}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8127568960189819},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6452133655548096},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5882574915885925},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5773168802261353},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5012598037719727},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49665457010269165},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4947895407676697},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4710421860218048},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46634572744369507},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.4501190781593323},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.42056265473365784},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.41852864623069763},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2692530155181885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06244403123855591},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1183278.1183283","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1183278.1183283","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W133350300","https://openalex.org/W284420689","https://openalex.org/W1525451859","https://openalex.org/W1607926272","https://openalex.org/W1985834822","https://openalex.org/W1996835746","https://openalex.org/W2036656440","https://openalex.org/W2060270693","https://openalex.org/W2068363706","https://openalex.org/W2071204190","https://openalex.org/W2091961944","https://openalex.org/W2128026324","https://openalex.org/W2163707777","https://openalex.org/W2164017389","https://openalex.org/W2170605748","https://openalex.org/W2576760960","https://openalex.org/W2603797972","https://openalex.org/W4248733413","https://openalex.org/W4253393488","https://openalex.org/W4255046774","https://openalex.org/W4388289506","https://openalex.org/W4388289526"],"related_works":["https://openalex.org/W4214737172","https://openalex.org/W3012938552","https://openalex.org/W2324712051","https://openalex.org/W4287825236","https://openalex.org/W1239946963","https://openalex.org/W71729059","https://openalex.org/W1524103539","https://openalex.org/W3216731410","https://openalex.org/W2970311880","https://openalex.org/W1973527399"],"abstract_inverted_index":{"The":[0,54],"replacement":[1],"(or":[2],"collection":[3],"or":[4,118],"choice":[5],")":[6,30,117,144],"axiom":[7],"scheme":[8,61],"BB(\u0393)":[9],"asserts":[10],"bounded":[11],"quantifier":[12],"exchange":[13],"as":[14],"follows:":[15],"\u2200":[16,34],"i":[17,27,35,40,44],"<":[18,24,36],"|":[19,21,37],"a":[20,25,38,80],"\u2203":[22,32],"x":[23,29],"\u03d5(":[26],",":[28,195,231],"\u2192":[31],"w":[33,42],"|\u03d5(":[39],",[":[41],"]":[43],"),":[45,65,135,167],"for":[46,208],"\u03d5":[47],"in":[48,68,92,175],"the":[49,60,146,151,183,190,209,245],"class":[50,153,192],"\u0393":[51],"of":[52],"formulas.":[53],"theory":[55,148,184,202],"S":[56,69,107],"1":[57,64,70,75,84,108,116,205,221],"2":[58,71,109,187,230],"proves":[59],"BB(\u03a3":[62,114,119,132,164],"b":[63,74,83,115,120,133,142,165,204,220],"and":[66,180,196],"thus":[67],"every":[72],"\u03a3":[73,82],"formula":[76,85],"is":[77,145,172,224,235,244],"equivalent":[78],"to":[79,99,216],"strict":[81],"(in":[86],"which":[87],"all":[88],"non-sharply-bounded":[89],"quantifiers":[90],"are":[91],"front).":[93],"Here":[94],"we":[95],"prove":[96,112,131,163],"(sometimes":[97],"subject":[98],"an":[100,199],"assumption)":[101],"that":[102,126,159,169,218,233],"certain":[103],"theories":[104],"weaker":[105,201,226],"than":[106,227],"do":[110],"not":[111,130,162,173],"either":[113],"0":[121,128,134,138,143,155,166,186,194,229],").":[122],"We":[123,157,212],"show":[124,158,217],"(unconditionally)":[125],"V":[127,137],"does":[129,161],"where":[136],"(essentially":[139],"I\u03a3":[140],"1,":[141],"two-sorted":[147],"associated":[149,188],"with":[150,189],"complexity":[152,191],"AC":[154],".":[156],"PV":[160],"assuming":[168,232],"integer":[170],"factoring":[171],"possible":[174],"probabilistic":[176,238],"polynomial":[177,239],"time.":[178],"Johannsen":[179],"Pollett":[181],"introduced":[182,198],"C":[185,228],"TC":[193],"later":[197],"apparently":[200],"\u0394":[203,219],"\u2212":[206,222],"CR":[207,223],"same":[210],"class.":[211],"use":[213],"our":[214],"methods":[215],"indeed":[225],"RSA":[234],"secure":[236],"against":[237],"time":[240],"attack.Our":[241],"main":[242],"tool":[243],"KPT":[246],"witnessing":[247],"theorem.":[248]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":27},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}