{"id":"https://openalex.org/W1988083342","doi":"https://doi.org/10.2307/2273702","title":"The relative efficiency of propositional proof systems","display_name":"The relative efficiency of propositional proof systems","publication_year":1979,"publication_date":"1979-03-01","ids":{"openalex":"https://openalex.org/W1988083342","doi":"https://doi.org/10.2307/2273702","mag":"1988083342"},"language":"en","primary_location":{"id":"doi:10.2307/2273702","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273702","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic 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":true,"raw_author_name":"Stephen A. Cook","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, CanadaM5S 1A7"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, CanadaM5S 1A7","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059094419","display_name":"Robert A. Reckhow","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Robert A. Reckhow","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, CanadaT6G 2E1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, CanadaT6G 2E1","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034555443"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":1.8678,"has_fulltext":false,"cited_by_count":826,"citation_normalized_percentile":{"value":0.81994148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"44","issue":"1","first_page":"36","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9829999804496765,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9829999804496765,"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.9775000214576721,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9718999862670898,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/tautology","display_name":"Tautology (logic)","score":0.6143327355384827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5961745977401733},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.590858519077301},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.5054037570953369},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.49586614966392517},{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.47475937008857727},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.456399142742157},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.448158323764801},{"id":"https://openalex.org/keywords/analytic-proof","display_name":"Analytic proof","score":0.42774030566215515},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41914984583854675},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.24004870653152466},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.22403967380523682},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20644089579582214},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0949467122554779},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.06791114807128906}],"concepts":[{"id":"https://openalex.org/C166374712","wikidata":"https://www.wikidata.org/wiki/Q209555","display_name":"Tautology (logic)","level":5,"score":0.6143327355384827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5961745977401733},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.590858519077301},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.5054037570953369},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.49586614966392517},{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.47475937008857727},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.456399142742157},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.448158323764801},{"id":"https://openalex.org/C135754263","wikidata":"https://www.wikidata.org/wiki/Q4751136","display_name":"Analytic proof","level":3,"score":0.42774030566215515},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41914984583854675},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.24004870653152466},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.22403967380523682},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20644089579582214},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0949467122554779},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.06791114807128906},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2307/2273702","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273702","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183740343","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183740343","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:CiteSeerX.psu:10.1.1.109.380","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/~bursuc/1-17/corr/cr.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.183.4270","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.4270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utoronto.ca/%7Esacook/homepage/cook_reckhow.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5299999713897705,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W76743840","https://openalex.org/W1543891730","https://openalex.org/W1655990431","https://openalex.org/W1717854044","https://openalex.org/W1984820433","https://openalex.org/W2014195574","https://openalex.org/W2036265926","https://openalex.org/W2041833446","https://openalex.org/W2082187221","https://openalex.org/W2275166338","https://openalex.org/W2320524668","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2531336559","https://openalex.org/W2091961944","https://openalex.org/W2098308941","https://openalex.org/W2461509449","https://openalex.org/W4234403895","https://openalex.org/W2159783982","https://openalex.org/W171706349","https://openalex.org/W153148314","https://openalex.org/W2626436722","https://openalex.org/W2490626787"],"abstract_inverted_index":{"We":[0],"are":[1,77,103],"interested":[2],"in":[3,15,147,150,186,194,201],"studying":[4],"the":[5,8,23,26,41,140,187,202,211,214],"length":[6,24,116,149,212],"of":[7,11,22,25,108,128,170,173,180,189,191,213],"shortest":[9],"proof":[10,17,42,67,115,193,203],"a":[12,20,62,109,143,151,168,171,178,183,192,208],"propositional":[13],"tautology":[14],"various":[16],"systems":[18,91,102],"as":[19,95,111,113,153],"function":[21,35,60],"tautology.":[27],"The":[28],"smallest":[29],"upper":[30],"bound":[31,64],"known":[32],"for":[33,65,130,142],"this":[34,59],"is":[36,57,71,154,167],"exponential,":[37],"no":[38,199],"matter":[39],"what":[40],"system.":[43,68],"A":[44],"question":[45,70],"we":[46,84,96,120],"would":[47],"like":[48],"to":[49,106],"answer":[50],"(but":[51],"have":[52],"not":[53],"been":[54],"able":[55],"to)":[56],"whether":[58],"has":[61],"polynomial":[63],"some":[66],"(This":[69],"motivated":[72],"below.)":[73],"Our":[74],"results":[75],"here":[76],"relative":[78],"results.":[79],"In":[80,118,162],"\u00a7\u00a72":[81],"and":[82,99],"3":[83],"indicate":[85],"that":[86,176],"all":[87],"standard":[88],"Hilbert":[89],"type":[90],"(or":[92],"Frege":[93,123,197],"systems,":[94,124],"call":[97],"them)":[98],"natural":[100],"deduction":[101],"equivalent,":[104],"up":[105],"application":[107],"polynomial,":[110],"far":[112],"minimum":[114],"goes.":[117],"\u00a74":[119],"introduce":[121],"extended":[122,196],"which":[125],"allow":[126],"introduction":[127],"abbreviations":[129,134],"formulas.":[131],"Since":[132],"these":[133],"can":[135],"be":[136,205],"iterated,":[137],"they":[138],"eliminate":[139],"need":[141,204],"possible":[144],"exponential":[145],"growth":[146],"formula":[148,215],"proof,":[152],"illustrated":[155],"by":[156],"an":[157,195],"example":[158],"(the":[159],"pigeonhole":[160],"principle).":[161],"fact,":[163],"Theorem":[164],"4.6":[165],"(which":[166],"variation":[169],"theorem":[172],"Statman)":[174],"states":[175],"with":[177],"penalty":[179],"at":[181],"most":[182],"linear":[184],"increase":[185],"number":[188],"lines":[190],"system,":[198],"line":[200],"more":[206],"than":[207],"constant":[209],"times":[210],"proved.":[216]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":29},{"year":2021,"cited_by_count":32},{"year":2020,"cited_by_count":29},{"year":2019,"cited_by_count":61},{"year":2018,"cited_by_count":23},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":23},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":32},{"year":2012,"cited_by_count":22}],"updated_date":"2026-05-30T09:04:40.226872","created_date":"2025-10-10T00:00:00"}