{"id":"https://openalex.org/W2073377134","doi":"https://doi.org/10.2307/2273458","title":"Definability of r. e. sets in a class of recursion theoretic structures","display_name":"Definability of r. e. sets in a class of recursion theoretic structures","publication_year":1983,"publication_date":"1983-09-01","ids":{"openalex":"https://openalex.org/W2073377134","doi":"https://doi.org/10.2307/2273458","mag":"2073377134"},"language":"en","primary_location":{"id":"doi:10.2307/2273458","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273458","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/A5039805938","display_name":"Robert E. Byerly","orcid":null},"institutions":[{"id":"https://openalex.org/I12315562","display_name":"Texas Tech University","ror":"https://ror.org/0405mnx93","country_code":"US","type":"education","lineage":["https://openalex.org/I12315562"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert E. Byerly","raw_affiliation_strings":["Texas Tech University, Lubbock, Texas 79409","Texas Tech University"],"affiliations":[{"raw_affiliation_string":"Texas Tech University, Lubbock, Texas 79409","institution_ids":["https://openalex.org/I12315562"]},{"raw_affiliation_string":"Texas Tech University","institution_ids":["https://openalex.org/I12315562"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039805938"],"corresponding_institution_ids":["https://openalex.org/I12315562"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.23900534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"48","issue":"3","first_page":"662","last_page":"669"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9846000075340271,"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.9846000075340271,"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.9742000102996826,"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/recursion","display_name":"Recursion (computer science)","score":0.7759290933609009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6722323298454285},{"id":"https://openalex.org/keywords/computability-theory","display_name":"Computability theory","score":0.6008646488189697},{"id":"https://openalex.org/keywords/universal-set","display_name":"Universal set","score":0.5700263381004333},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5629444122314453},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.5249031782150269},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.5205986499786377},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4993777275085449},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48127859830856323},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4528553783893585},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.44144773483276367},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4319779872894287},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2784556746482849},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2051151692867279},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14203104376792908}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7759290933609009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6722323298454285},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.6008646488189697},{"id":"https://openalex.org/C102565666","wikidata":"https://www.wikidata.org/wiki/Q1378301","display_name":"Universal set","level":3,"score":0.5700263381004333},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5629444122314453},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.5249031782150269},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.5205986499786377},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4993777275085449},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48127859830856323},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4528553783893585},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.44144773483276367},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4319779872894287},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2784556746482849},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2051151692867279},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14203104376792908},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2273458","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273458","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/1183741325","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183741325","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":6,"referenced_works":["https://openalex.org/W2064932740","https://openalex.org/W2171535997","https://openalex.org/W2268847858","https://openalex.org/W2333124185","https://openalex.org/W2530006810","https://openalex.org/W2905135108"],"related_works":["https://openalex.org/W4242488152","https://openalex.org/W1988755390","https://openalex.org/W2077783082","https://openalex.org/W2138384354","https://openalex.org/W1589207578","https://openalex.org/W1555412307","https://openalex.org/W4388310202","https://openalex.org/W2359098868","https://openalex.org/W4247035339","https://openalex.org/W2073377134"],"abstract_inverted_index":{"It":[0,18],"is":[1,8,41,58,65,250,311],"known":[2],"[4,":[3],"Theorem":[4],"11-X(b)]":[5],"that":[6,22,52,132],"there":[7],"only":[9,137],"one":[10],"acceptable":[11,67],"universal":[12,29,68,98,139,171],"function":[13,30,140,172],"up":[14,35],"to":[15,36,151,204,241,253,282,329],"recursive":[16,37,120],"isomorphism.":[17,38],"follows":[19],"from":[20],"this":[21,162,198,290,306],"sets":[23,74,131,159,210],"definable":[24,160],"in":[25,161,179,223,272,333],"terms":[26],"of":[27,48,71,93,96,103,108,116,118,157,166,170,175,219,221,227,233,256,261,267,326],"a":[28,90,97,138,192,228,231],"alone":[31],"are":[32,164,183,265],"specified":[33],"uniquely":[34],"(An":[39],"example":[40],"the":[42,72,94,109,112,167,176,206,217,224,243,254,258,268,283,298,321,330],"set":[43,264],"K":[44],",":[45,63],"which":[46,84,180],"consists":[47],"all":[49],"n":[50,54,56,62],"such":[51,88,314],"{":[53],"}(":[55],")":[57],"defined,":[59],"where":[60],"\u03bb":[61],"m{n}(m)":[64],"an":[66,251,262],"function.)":[69],"Many":[70],"interesting":[73],"constructed":[75],"and":[76,122,141,318],"studied":[77],"by":[78,211,313],"recursion":[79,334],"theorists,":[80],"however,":[81],"have":[82],"definitions":[83,105],"involve":[85],"additional":[86],"notions,":[87],"as":[89,230,316],"specific":[91],"enumeration":[92],"graph":[95],"function.":[99],"In":[100,146],"particular,":[101,147],"many":[102],"these":[104,309],"make":[106],"use":[107,216],"interplay":[110],"between":[111],"purely":[113,124,143],"number-theoretic":[114,144],"properties":[115,156,260],"indices":[117],"partial":[119],"functions":[121],"their":[123,212],"recursion-theoretic":[125,155,259],"properties.":[126],"This":[127,200,248],"paper":[128],"concerns":[129],"r.e.":[130,158,209,263,295],"can":[133],"be":[134,239,325],"defined":[135],"using":[136],"some":[142],"concepts.":[145],"we":[148],"would":[149],"like":[150],"know":[152],"when":[153,257],"certain":[154],"way":[163,178],"independent":[165,174,266,327],"particular":[168,177,269,294],"choice":[169],"(equivalently,":[173],"godel":[181],"numbers":[182],"identified":[184],"with":[185],"natural":[186],"numbers).":[187],"We":[188,236],"will":[189,201,237],"first":[190],"develop":[191],"suitable":[193],"model-theoretic":[194],"framework":[195],"for":[196,292,308],"discussing":[197],"question.":[199],"enable":[202],"us":[203],"classify":[205],"formulas":[207],"defining":[208,293],"logical":[213,234],"complexity.":[214],"(We":[215],"number":[218],"alternations":[220],"quantifiers":[222],"prenex":[225],"form":[226],"formula":[229],"measure":[232],"complexity.)":[235],"then":[238],"able":[240],"examine":[242],"question":[244,255,307],"at":[245,289],"each":[246],"level.":[247],"work":[249,323],"approach":[252],"parameters":[270],"used":[271,288],"its":[273],"construction.":[274],"As":[275],"such,":[276],"it":[277],"does":[278],"not":[279],"apply":[280],"directly":[281],"construction":[284],"techniques":[285,310],"most":[286],"commonly":[287],"time":[291],"sets,":[296],"e.g.,":[297],"priority":[299],"method.":[300],"A":[301],"more":[302],"direct":[303],"attack":[304],"on":[305],"represented":[312],"works":[315],"[3]":[317],"[5].":[319],"However,":[320],"present":[322],"should":[324],"interest":[328],"logician":[331],"interested":[332],"theory.":[335]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
