{"id":"https://openalex.org/W1539014","doi":null,"title":"Predicative recursion and computational complexity","display_name":"Predicative recursion and computational complexity","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W1539014","mag":"1539014"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.8024","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.8024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.toronto.edu/pub/reports/theory/cs-92-264.ps.Z","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5023976191","display_name":"Stephen J. Bellantoni","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Stephen J. Bellantoni","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5023976191"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4535,"has_fulltext":true,"cited_by_count":64,"citation_normalized_percentile":{"value":0.94858852,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9692000150680542,"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.9692000150680542,"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.021199999377131462,"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.005799999926239252,"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/computational-complexity","display_name":"computational complexity","score":0.7450000047683716},{"id":"https://openalex.org/keywords/polynomial-time","display_name":"polynomial time","score":0.7829999923706055},{"id":"https://openalex.org/keywords/logspace","display_name":"logspace","score":0.7599999904632568},{"id":"https://openalex.org/keywords/nc","display_name":"NC","score":0.9359999895095825},{"id":"https://openalex.org/keywords/induction-principle","display_name":"induction principle","score":0.6909999847412109},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"first-order logic","score":0.414000004529953}],"concepts":[{"id":"https://openalex.org/C129131279","wikidata":"https://www.wikidata.org/wiki/Q1931259","display_name":"Predicative expression","level":2,"score":0.700738787651062},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.632940411567688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5431190729141235},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4225744605064392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4079224765300751},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40427523851394653},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37910765409469604},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.34924161434173584},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.14397719502449036},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.11339691281318665},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.1030537486076355},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.8024","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.8024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.toronto.edu/pub/reports/theory/cs-92-264.ps.Z","raw_type":"text"},{"id":"mag:1539014","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=920205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1520244229","https://openalex.org/W6990274758","https://openalex.org/W25723464","https://openalex.org/W2155681304","https://openalex.org/W7096987765","https://openalex.org/W7101010099","https://openalex.org/W7100848205","https://openalex.org/W203645649","https://openalex.org/W2161025668","https://openalex.org/W7096683639"],"abstract_inverted_index":{"The":[0,102],"purpose":[1],"of":[2,11,85,100,126],"this":[3,55,92],"thesis":[4],"is":[5,19,104,130],"to":[6,45,79,96,118,132,141],"give":[7],"a":[8,17,136,143],"\"foundational\"":[9],"characterization":[10,18],"some":[12],"common":[13],"complexity":[14],"classes.":[15],"Such":[16],"distinguished":[20],"by":[21],"the":[22,35,60,64,81,97,109,124],"fact":[23],"that":[24],"no":[25],"explicit":[26],"resource":[27],"bounds":[28],"are":[29],"used.":[30],"For":[31],"example,":[32],"we":[33,76],"characterize":[34],"polynomial":[36,58],"time":[37],"computable":[38],"functions":[39],"without":[40],"making":[41],"any":[42],"direct":[43],"reference":[44],"polynomials,":[46],"time,":[47,59],"or":[48],"even":[49],"computation.":[50],"Complexity":[51],"classes":[52],"characterized":[53],"in":[54,135],"way":[56],"include":[57],"functional":[61],"polytime":[62],"hierarchy,":[63],"logspace":[65],"decidable":[66],"problems,":[67],"and":[68,87,89,114],"NC.":[69],"After":[70],"developing":[71],"these":[72],"\"resource":[73],"free\"":[74],"definitions,":[75],"apply":[77],"them":[78],"redeveloping":[80],"feasible":[82],"logical":[83],"system":[84,94,99],"Cook":[86],"Urquhart,":[88],"show":[90],"how":[91,140],"first-order":[93],"relates":[95],"second-order":[98],"Leivant.":[101],"connection":[103],"an":[105],"interesting":[106,131],"one":[107],"since":[108],"systems":[110],"were":[111],"defined":[112],"independently":[113],"have":[115],"what":[116],"appear":[117],"be":[119],"very":[120,137],"different":[121],"rules":[122],"for":[123],"principle":[125],"induction.":[127],"Furthermore":[128],"it":[129],"see,":[133],"albeit":[134],"specific":[138],"context,":[139],"retract":[142],"second":[144],"order":[145],"statement,":[146],"(\"inducti...":[147]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}