{"id":"https://openalex.org/W2043285104","doi":"https://doi.org/10.2307/2273730","title":"Reducibilities in two models for combinatory logic","display_name":"Reducibilities in two models for combinatory logic","publication_year":1979,"publication_date":"1979-06-01","ids":{"openalex":"https://openalex.org/W2043285104","doi":"https://doi.org/10.2307/2273730","mag":"2043285104"},"language":"en","primary_location":{"id":"doi:10.2307/2273730","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273730","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"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":"Journal 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/A5050888128","display_name":"Luis E. Sanchis","orcid":null},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Luis E. Sanchis","raw_affiliation_strings":["School of Computer and Information Science, Syracuse University, Syracuse NY 13210"],"affiliations":[{"raw_affiliation_string":"School of Computer and Information Science, Syracuse University, Syracuse NY 13210","institution_ids":["https://openalex.org/I70983195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050888128"],"corresponding_institution_ids":["https://openalex.org/I70983195"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.20360767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"44","issue":"2","first_page":"221","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9927999973297119,"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.9927999973297119,"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.9251000285148621,"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/hypergraph","display_name":"Hypergraph","score":0.7360051870346069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5139281749725342},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.47466138005256653},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4713152050971985},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.46204185485839844},{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.44330033659935},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.4313986897468567},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37265878915786743},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36965280771255493},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18285435438156128}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7360051870346069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5139281749725342},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.47466138005256653},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4713152050971985},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.46204185485839844},{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.44330033659935},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.4313986897468567},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37265878915786743},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36965280771255493},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18285435438156128},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":2,"locations":[{"id":"doi:10.2307/2273730","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273730","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"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":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183740389","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183740389","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1505215237","https://openalex.org/W1600379495","https://openalex.org/W2026821718","https://openalex.org/W2060192729","https://openalex.org/W2069624526","https://openalex.org/W2069764971","https://openalex.org/W2075387691","https://openalex.org/W2117832390","https://openalex.org/W2268847858","https://openalex.org/W2530006810","https://openalex.org/W2797656628","https://openalex.org/W2905135108","https://openalex.org/W4205097965"],"related_works":["https://openalex.org/W2119244842","https://openalex.org/W4285436350","https://openalex.org/W2090113742","https://openalex.org/W4324016496","https://openalex.org/W2215138167","https://openalex.org/W4254404873","https://openalex.org/W4231495498","https://openalex.org/W4312201671","https://openalex.org/W2306527987","https://openalex.org/W3160192459"],"abstract_inverted_index":{"This":[0],"paper":[1,179],"proposes":[2],"a":[3,32,134,164,261],"generalization":[4],"of":[5,11,24,38,69,88,95,136,140,155,170,177,187,206,267],"several":[6,201],"reducibilities":[7,28,84,97,194,218],"in":[8,31,42,61,64,98,111,118,142,195,219,243,253],"the":[9,39,52,79,105,115,121,130,137,153,156,168,174,178,182,188,193,196,220,227,241,254,268],"sense":[10],"recursive":[12,143],"function":[13,144],"theory.":[14,145],"For":[15,104,230],"this":[16,65,99,149,171,231],"purpose":[17,232],"two":[18,235],"structures":[19],"are":[20,29,67,86,204],"introduced":[21,57],"as":[22,133],"models":[23],"combinatory":[25],"logic":[26],"and":[27,55,71,82,90,113,162,184,199,212,223],"defined":[30],"rather":[33],"natural":[34,165],"way":[35,100],"by":[36,58,264],"means":[37],"application":[40],"operation":[41],"each":[43,251],"model.":[44,270],"The":[45,74,93],"first":[46,175],"model":[47,54,66,76,81,107,117,198,222,256],"we":[48,180,191,216,233,248],"consider":[49],"is":[50,77,101,109,125,159],"called":[51,78],"graph":[53,106,197,269],"was":[56],"Dana":[59],"Scott":[60],"[11].":[62],"Reducibilities":[63],"generalizations":[68,87,205],"enumeration":[70],"Turing":[72,213],"reducibilities.":[73,92,214],"second":[75],"hypergraph":[80,116,221,255],"induces":[83],"which":[85,158,203],"hyperenumeration":[89],"hyperarithmetical":[91],"possibility":[94],"formulating":[96],"not":[102,151],"new.":[103],"it":[108,124],"implicit":[110],"[7]":[112],"for":[114,167,210],"[9].":[119],"On":[120],"other":[122],"hand":[123],"possible":[126],"to":[127,225],"look":[128],"at":[129],"present":[131],"method":[132],"variant":[135],"well-known":[138],"technique":[139],"relativization":[141],"We":[146],"think":[147],"that":[148,250],"does":[150],"exhaust":[152],"power":[154],"method,":[157],"conceptually":[160],"elegant":[161],"provides":[163],"frame":[166],"results":[169],"paper.":[172],"In":[173,246],"part":[176],"discuss":[181],"definition":[183],"general":[185],"properties":[186,207],"models.":[189,245],"Then":[190],"introduce":[192],"prove":[200,234,249],"theorems":[202,236],"already":[208],"Known":[209],"enmeration":[211],"Next":[215],"define":[217],"try":[224],"extend":[226],"preceding":[228],"results.":[229],"showing":[237],"significant":[238],"relations":[239],"between":[240],"operators":[242],"both":[244],"fact":[247],"operator":[252,266],"can":[257],"be":[258],"simulated":[259],"on":[260],"comeager":[262],"set":[263],"an":[265]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}