{"id":"https://openalex.org/W169256259","doi":"https://doi.org/10.1007/978-1-4612-2566-9_6","title":"First Order Bounded Arithmetic and Small Boolean Circuit Complexity Classes","display_name":"First Order Bounded Arithmetic and Small Boolean Circuit Complexity Classes","alternate_titles":[],"publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W169256259","doi":"https://doi.org/10.1007/978-1-4612-2566-9_6","mag":"169256259"},"language":"en","primary_location":{"id":"doi:10.1007/978-1-4612-2566-9_6","doi":"https://doi.org/10.1007/978-1-4612-2566-9_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4612-2566-9_6","pdf_url":null,"source":{"id":"https://openalex.org/S4306462921","display_name":"Birkh\u00e4user Boston eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Feasible Mathematics II","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W636367345","display_name":"Feasible Mathematics II","relationship":"volume"}],"lineage":["https://openalex.org/W169256259","https://openalex.org/W636367345"],"child_works_count":0,"type":"book-chapter","is_traditional":true,"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/A5038186958","display_name":"Peter Clote","orcid":"https://orcid.org/0000-0003-3628-2874","observed_orcids":["https://orcid.org/0000-0003-3628-2874"]},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]},{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Clote","raw_affiliation_strings":["Mathematics Dept., University of Illinois Urbana, Urbana, IL, 61801, USA","Computer Science Dept., Boston College, Chestnut Hill, MA, 02146, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Dept., University of Illinois Urbana, Urbana, IL, 61801, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Computer Science Dept., Boston College, Chestnut Hill, MA, 02146, USA","institution_ids":["https://openalex.org/I103531236"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081729792","display_name":"Gaisi Takeuti","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gaisi Takeuti","raw_affiliation_strings":["Mathematics Dept., University of Illinois Urbana, Urbana, IL, 61801, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Dept., University of Illinois Urbana, Urbana, IL, 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.4072,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.98125509,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"154","last_page":"218"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9829000234603882,"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.9829000234603882,"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/T10126","display_name":"Logic, programming, and type systems","score":0.005100000184029341,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0044999998062849045,"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/bounded-arithmetic","display_name":"bounded arithmetic","score":0.8989999890327454},{"id":"https://openalex.org/keywords/first-order-arithmetic","display_name":"first-order arithmetic","score":0.6980000138282776},{"id":"https://openalex.org/keywords/boolean-circuit-complexity","display_name":"Boolean circuit complexity","score":0.7829999923706055},{"id":"https://openalex.org/keywords/threshold-circuits","display_name":"threshold circuits","score":0.6579999923706055},{"id":"https://openalex.org/keywords/alternating-turing-machines","display_name":"alternating Turing machines","score":0.953000009059906},{"id":"https://openalex.org/keywords/primitive-recursive-functions","display_name":"primitive recursive functions","score":0.6859999895095825}],"concepts":[{"id":"https://openalex.org/C65148605","wikidata":"https://www.wikidata.org/wiki/Q7442973","display_name":"Second-order arithmetic","level":3,"score":0.6532534956932068},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.6364034414291382},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6106323599815369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6057912707328796},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5986907482147217},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5296494960784912},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.4983377456665039},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4969539940357208},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49653464555740356},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.49157842993736267},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.4843941330909729},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.4673367440700531},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.4446304738521576},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4437515437602997},{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.43204209208488464},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.4292130172252655},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42393097281455994},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.3964402973651886},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.3046056032180786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3029766380786896},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27829989790916443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23632532358169556},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.16676589846611023},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.16216960549354553},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.16132605075836182},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-1-4612-2566-9_6","doi":"https://doi.org/10.1007/978-1-4612-2566-9_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4612-2566-9_6","pdf_url":null,"source":{"id":"https://openalex.org/S4306462921","display_name":"Birkh\u00e4user Boston eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Feasible Mathematics II","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W560364776","https://openalex.org/W1504491664","https://openalex.org/W1569205584","https://openalex.org/W1589141582","https://openalex.org/W1968584500","https://openalex.org/W1972719943","https://openalex.org/W1981324778","https://openalex.org/W1983705661","https://openalex.org/W2017205387","https://openalex.org/W2045583484","https://openalex.org/W2055874330","https://openalex.org/W2090101829","https://openalex.org/W2104952158","https://openalex.org/W2109174551","https://openalex.org/W2136868774","https://openalex.org/W2163512254","https://openalex.org/W2167115661","https://openalex.org/W2298359438","https://openalex.org/W4236783472","https://openalex.org/W4240781210","https://openalex.org/W4388289526","https://openalex.org/W4388289548","https://openalex.org/W6682487833","https://openalex.org/W7008825546","https://openalex.org/W7048286187"],"related_works":["https://openalex.org/W2155681304","https://openalex.org/W4388289488","https://openalex.org/W41951963","https://openalex.org/W1992817659","https://openalex.org/W4205910551","https://openalex.org/W4297809195","https://openalex.org/W2493088804","https://openalex.org/W4402694983","https://openalex.org/W7166825218"],"abstract_inverted_index":{"A":[0],"well":[1],"known":[2],"result":[3],"of":[4,10,24,43,46,56,97,108,127],"proof":[5],"theory":[6,23],"is":[7],"the":[8,20,28,109,124],"characterization":[9,107],"primitive":[11],"recursive":[12,18],"functions":[13,53],"\u0192":[14],"as":[15],"those":[16,62],"provably":[17,51],"in":[19,118],"first":[21,47],"order":[22,48],"Peano":[25],"arithmetic":[26],"with":[27,75],"induction":[29],"axiom":[30],"restricted":[31],"to":[32],"\u03a3":[33],"1":[34],"formulas.":[35],"In":[36],"this":[37],"paper,":[38],"we":[39,103],"study":[40],"a":[41,57,69,105],"variety":[42],"weak":[44,120],"theories":[45],"arithmetic,":[49],"whose":[50],"total":[52],"(with":[54],"graphs":[55],"certain":[58],"form)":[59],"are":[60],"exactly":[61],"computable":[63],"within":[64],"some":[65],"resource":[66],"bound":[67],"on":[68],"particular":[70],"computation":[71],"model":[72],"(boolean":[73],"circuits,":[74,84],"possible":[76],"parity":[77],"or":[78,82,85,89],"MOD":[79],"6":[80],"gates,":[81],"threshold":[83],"alternating":[86],"Turing":[87,91],"machines,":[88],"ordinary":[90],"machines).":[92],"To":[93],"establish":[94],"these":[95],"kinds":[96],"results":[98],"for":[99],"small":[100],"complexity":[101,110],"classes,":[102],"provide":[104],"recursion-theoretic":[106],"class,":[111],"prove":[112],"how":[113],"one":[114],"can":[115],"encode":[116],"sequences":[117],"very":[119],"theories,":[121],"and":[122],"use":[123],"witnessing":[125],"technique":[126],"[7].":[128]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W169256259","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
