{"id":"https://openalex.org/W1992139964","doi":"https://doi.org/10.2307/421100","title":"An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras","display_name":"An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras","publication_year":1997,"publication_date":"1997-12-01","ids":{"openalex":"https://openalex.org/W1992139964","doi":"https://doi.org/10.2307/421100","mag":"1992139964"},"language":"en","primary_location":{"id":"doi:10.2307/421100","is_oa":false,"landing_page_url":"https://doi.org/10.2307/421100","pdf_url":null,"source":{"id":"https://openalex.org/S130801046","display_name":"Bulletin of Symbolic Logic","issn_l":"1079-8986","issn":["1079-8986","1943-5894"],"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":"Bulletin 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/A5108530891","display_name":"Martin Hofmann","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Hofmann","raw_affiliation_strings":["Fachbereich Mathematik, Technische Universit\u00e4t Darmstadt, Schlossgartenstrasse 7, 64289 Darmstadt, Germany.E-mail:"],"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik, Technische Universit\u00e4t Darmstadt, Schlossgartenstrasse 7, 64289 Darmstadt, Germany.E-mail:","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108530891"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":2.5805,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88673257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":"4","first_page":"469","last_page":"486"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9957000017166138,"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.9957000017166138,"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.9830999970436096,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9815999865531921,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.9134951829910278},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6605764031410217},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6432144045829773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5500739812850952},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.5216051340103149},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.5050707459449768},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44570082426071167},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.4223243296146393},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4169192910194397},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40918436646461487},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.36109212040901184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3232637047767639},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2410888671875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22901803255081177},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2123010754585266},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1868850588798523},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10764402151107788}],"concepts":[{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.9134951829910278},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6605764031410217},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6432144045829773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5500739812850952},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.5216051340103149},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.5050707459449768},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44570082426071167},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.4223243296146393},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4169192910194397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40918436646461487},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.36109212040901184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3232637047767639},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2410888671875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22901803255081177},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2123010754585266},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1868850588798523},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10764402151107788},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2307/421100","is_oa":false,"landing_page_url":"https://doi.org/10.2307/421100","pdf_url":null,"source":{"id":"https://openalex.org/S130801046","display_name":"Bulletin of Symbolic Logic","issn_l":"1079-8986","issn":["1079-8986","1943-5894"],"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":"Bulletin of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.bsl/1182353537","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.bsl/1182353537","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.47.8131","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.8131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.ed.ac.uk/home/mxh/bsl.ps.gz","raw_type":"text"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:7510","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/7510/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Artikel"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W36355091","https://openalex.org/W1517052937","https://openalex.org/W1534018603","https://openalex.org/W1591846509","https://openalex.org/W1965297988","https://openalex.org/W1987943786","https://openalex.org/W2049362364","https://openalex.org/W2069792094","https://openalex.org/W2075380453","https://openalex.org/W2167221352","https://openalex.org/W2324455841","https://openalex.org/W2612444427","https://openalex.org/W2911908026","https://openalex.org/W6990055222"],"related_works":["https://openalex.org/W3204615532","https://openalex.org/W2026191634","https://openalex.org/W4211259775","https://openalex.org/W1536078516","https://openalex.org/W2404907747","https://openalex.org/W2074466497","https://openalex.org/W2270021366","https://openalex.org/W2027321599","https://openalex.org/W2162177529","https://openalex.org/W2310420552"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"use":[2,64],"the":[3,25,69,83],"category":[4],"of":[5,36,91,95],"presheaves":[6],"over":[7,60],"PTIME":[8,26,37],"-functions":[9],"in":[10,73],"order":[11],"to":[12,39,44,66,86],"show":[13],"that":[14,68],"Cook":[15],"and":[16,63],"Urquhart's":[17],"higher-order":[18,89],"function":[19],"algebra":[20],"PV":[21,61],"\u03c9":[22,62],"defines":[23],"exactly":[24],"-iunctions.":[27],"As":[28],"a":[29,33,47,52,87],"byproduct":[30],"we":[31,50,81],"obtain":[32,51],"syntax-free":[34],"generalisation":[35],"-computability":[38],"higher":[40],"types.":[41],"By":[42],"restricting":[43],"sheaves":[45],"for":[46,54],"suitable":[48],"topology":[49],"model":[53],"intuitionistic":[55],"predicate":[56],"logic":[57],"with":[58],"-induction":[59],"this":[65,74],"re-establish":[67],"provably":[70],"total":[71],"functions":[72],"system":[75,93],"are":[76],"polynomial":[77],"time":[78],"computable.":[79],"Finally,":[80],"apply":[82],"category-theoretic":[84],"approach":[85],"new":[88],"extension":[90],"Bellantoni-Cook's":[92],"BC":[94],"safe":[96],"recursion.":[97]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}