{"id":"https://openalex.org/W2346778503","doi":"https://doi.org/10.23638/lmcs-13(1:4)2017","title":"Unprovability of circuit upper bounds in Cook's theory PV","display_name":"Unprovability of circuit upper bounds in Cook's theory PV","publication_year":2017,"publication_date":"2017-02-03","ids":{"openalex":"https://openalex.org/W2346778503","doi":"https://doi.org/10.23638/lmcs-13(1:4)2017","mag":"2346778503"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-13(1:4)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(1:4)2017","pdf_url":"https://lmcs.episciences.org/3119/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/3119/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069803587","display_name":"Jan Kraj\u0131\u0301\u010dek","orcid":"https://orcid.org/0000-0003-0670-3957"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jan Krajicek","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110785998","display_name":"Igor Carboni Oliveira","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Igor C. Oliveira","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069803587"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.8724,"has_fulltext":true,"cited_by_count":30,"citation_normalized_percentile":{"value":0.97420387,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"Volume 13, Issue 1","issue":null,"first_page":null,"last_page":null},"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.9995999932289124,"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.9995999932289124,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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/constructive","display_name":"Constructive","score":0.7069942951202393},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6514707207679749},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.6163848638534546},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5966486930847168},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.5713639855384827},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49992918968200684},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4637029767036438},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39367520809173584},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3241639733314514},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24095472693443298},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10534778237342834},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.052256375551223755}],"concepts":[{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.7069942951202393},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6514707207679749},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.6163848638534546},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5966486930847168},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.5713639855384827},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49992918968200684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4637029767036438},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39367520809173584},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3241639733314514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24095472693443298},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10534778237342834},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.052256375551223755},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-13(1:4)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(1:4)2017","pdf_url":"https://lmcs.episciences.org/3119/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1605.00263","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1605.00263","pdf_url":"https://arxiv.org/pdf/1605.00263","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":"doi:10.48550/arxiv.1605.00263","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1605.00263","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-13(1:4)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(1:4)2017","pdf_url":"https://lmcs.episciences.org/3119/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3250453925","display_name":null,"funder_award_id":"2015-1","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G3635233365","display_name":null,"funder_award_id":"200252/2015-1","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2346778503.pdf","grobid_xml":"https://content.openalex.org/works/W2346778503.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1537230380","https://openalex.org/W1607926272","https://openalex.org/W1614370253","https://openalex.org/W1981324778","https://openalex.org/W1984477611","https://openalex.org/W1993138363","https://openalex.org/W2011612028","https://openalex.org/W2030202224","https://openalex.org/W2054191060","https://openalex.org/W2071204190","https://openalex.org/W2087012565","https://openalex.org/W2091961944","https://openalex.org/W2116335551","https://openalex.org/W2125894854","https://openalex.org/W2169748287","https://openalex.org/W2912080987","https://openalex.org/W2944371034"],"related_works":["https://openalex.org/W2954167023","https://openalex.org/W2064351239","https://openalex.org/W2114983089","https://openalex.org/W2949665548","https://openalex.org/W2950188642","https://openalex.org/W2028676759","https://openalex.org/W3102174417","https://openalex.org/W1589204344","https://openalex.org/W1968663039","https://openalex.org/W2257471395"],"abstract_inverted_index":{"We":[0],"establish":[1],"unconditionally":[2],"that":[3,18,26],"for":[4],"every":[5],"integer":[6],"$k":[7],"\\geq":[8],"1$":[9],"there":[10],"is":[11,20,32],"a":[12],"language":[13],"$L":[14,27],"\\in":[15],"\\mbox{P}$":[16],"such":[17],"it":[19],"consistent":[21],"with":[22],"Cook's":[23],"theory":[24],"PV":[25],"\\notin":[28],"Size(n^k)$.":[29],"Our":[30],"argument":[31],"non-constructive":[33],"and":[34],"does":[35],"not":[36],"provide":[37],"an":[38],"explicit":[39],"description":[40],"of":[41],"this":[42],"language.":[43]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":29}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}