{"id":"https://openalex.org/W2076940966","doi":"https://doi.org/10.1093/logcom/exq009","title":"Higher Types, Finite Domains and Resource-bounded Turing Machines","display_name":"Higher Types, Finite Domains and Resource-bounded Turing Machines","publication_year":2010,"publication_date":"2010-02-17","ids":{"openalex":"https://openalex.org/W2076940966","doi":"https://doi.org/10.1093/logcom/exq009","mag":"2076940966"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exq009","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exq009","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","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/A5063909629","display_name":"Lars Kristiansen","orcid":"https://orcid.org/0000-0002-6749-4004"},"institutions":[{"id":"https://openalex.org/I184942183","display_name":"University of Oslo","ror":"https://ror.org/01xtthb56","country_code":"NO","type":"education","lineage":["https://openalex.org/I184942183"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"L. Kristiansen","raw_affiliation_strings":["Department of Mathematics, University of Oslo, PO Box 1053, Blindern, NO-0316 Oslo, Norway.E-mail: larsk@math.uio.no","Department of Mathematics, University of Oslo, PO Box 1053, Blindern, NO-0316 Oslo, Norway.E-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Oslo, PO Box 1053, Blindern, NO-0316 Oslo, Norway.E-mail: larsk@math.uio.no","institution_ids":["https://openalex.org/I184942183"]},{"raw_affiliation_string":"Department of Mathematics, University of Oslo, PO Box 1053, Blindern, NO-0316 Oslo, Norway.E-mail:","institution_ids":["https://openalex.org/I184942183"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063909629"],"corresponding_institution_ids":["https://openalex.org/I184942183"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.451,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73264821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":"2","first_page":"281","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9997000098228455,"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/computer-science","display_name":"Computer science","score":0.5955244898796082},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.5473932027816772},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5433380007743835},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.5341175198554993},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5069570541381836},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4981248378753662},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.49430227279663086},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4802394509315491},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4668968617916107},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.4656674861907959},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.42359286546707153},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.42067304253578186},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36830341815948486},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.36221233010292053},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.3286992311477661},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2946647107601166}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5955244898796082},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.5473932027816772},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5433380007743835},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.5341175198554993},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5069570541381836},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4981248378753662},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.49430227279663086},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4802394509315491},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4668968617916107},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.4656674861907959},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.42359286546707153},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.42067304253578186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36830341815948486},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.36221233010292053},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.3286992311477661},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2946647107601166},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/logcom/exq009","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exq009","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W25723464","https://openalex.org/W43155751","https://openalex.org/W146497792","https://openalex.org/W577957417","https://openalex.org/W615345195","https://openalex.org/W1487266856","https://openalex.org/W1495212203","https://openalex.org/W1507860656","https://openalex.org/W1554061309","https://openalex.org/W1566223103","https://openalex.org/W1572440476","https://openalex.org/W1579247651","https://openalex.org/W1590269596","https://openalex.org/W1624497191","https://openalex.org/W1969119492","https://openalex.org/W1969548989","https://openalex.org/W1970954854","https://openalex.org/W1971256104","https://openalex.org/W1988871153","https://openalex.org/W2007147248","https://openalex.org/W2010307931","https://openalex.org/W2016065322","https://openalex.org/W2016299452","https://openalex.org/W2023166738","https://openalex.org/W2027321599","https://openalex.org/W2034895188","https://openalex.org/W2035281781","https://openalex.org/W2043509890","https://openalex.org/W2069792094","https://openalex.org/W2074965491","https://openalex.org/W2084909062","https://openalex.org/W2105438076","https://openalex.org/W2121065490","https://openalex.org/W3029117793"],"related_works":["https://openalex.org/W293759077","https://openalex.org/W3014863312","https://openalex.org/W1662868588","https://openalex.org/W2547364878","https://openalex.org/W195780958","https://openalex.org/W1526857708","https://openalex.org/W2119421720","https://openalex.org/W2556768775","https://openalex.org/W2348596562","https://openalex.org/W68480898"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2],"neat":[3],"and":[4,35,44,55],"natural":[5],"fragments":[6,40,45],"of":[7,41,46],"the":[8,37],"higher":[9],"order":[10],"programming":[11],"language,":[12],"PCF,":[13],"capture":[14],"complexity":[15],"classes":[16],"defined":[17],"by":[18],"imposing":[19],"resource":[20],"bounds":[21],"on":[22,31,32,52],"Turing":[23],"machines.":[24],"Moreover,":[25],"we":[26],"survey":[27],"some":[28],"related":[29],"research":[30],"G\u00f6del\u2019s":[33,42],"T,":[34],"discuss":[36],"relationship":[38],"between":[39],"T":[43],"PCF.":[47],"Our":[48],"proofs":[49],"are":[50],"based":[51],"denotational":[53],"semantics":[54],"domain":[56],"theory.":[57]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}