{"id":"https://openalex.org/W1981029600","doi":"https://doi.org/10.2307/2272825","title":"The uniform regular set theorem in \u03b1-recursion theory","display_name":"The uniform regular set theorem in \u03b1-recursion theory","publication_year":1978,"publication_date":"1978-06-01","ids":{"openalex":"https://openalex.org/W1981029600","doi":"https://doi.org/10.2307/2272825","mag":"1981029600"},"language":"en","primary_location":{"id":"doi:10.2307/2272825","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272825","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/A5032544239","display_name":"Wolfgang Maa\u00df","orcid":"https://orcid.org/0000-0003-4057-0924"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Wolfgang Maass","raw_affiliation_strings":["Mathematisches Institut der Universit\u00e4t M\u00fcnchen, D-8 M\u00fcnchen 2, West Germany"],"affiliations":[{"raw_affiliation_string":"Mathematisches Institut der Universit\u00e4t M\u00fcnchen, D-8 M\u00fcnchen 2, West Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032544239"],"corresponding_institution_ids":["https://openalex.org/I8204097"],"apc_list":null,"apc_paid":null,"fwci":1.0614,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73900221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"43","issue":"2","first_page":"270","last_page":"279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9988999962806702,"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.9988999962806702,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.953499972820282,"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.8446052670478821},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7518081665039062},{"id":"https://openalex.org/keywords/computability-theory","display_name":"Computability theory","score":0.7374523878097534},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7154286503791809},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6466942429542542},{"id":"https://openalex.org/keywords/double-recursion","display_name":"Double recursion","score":0.6264047622680664},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.6223672032356262},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5764821171760559},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5405404567718506},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.4726537764072418},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.4565654695034027},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45138978958129883},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.3459213376045227},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1795160472393036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16706743836402893}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8446052670478821},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7518081665039062},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.7374523878097534},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7154286503791809},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6466942429542542},{"id":"https://openalex.org/C139503435","wikidata":"https://www.wikidata.org/wiki/Q5300083","display_name":"Double recursion","level":3,"score":0.6264047622680664},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.6223672032356262},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5764821171760559},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5405404567718506},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.4726537764072418},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.4565654695034027},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45138978958129883},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.3459213376045227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1795160472393036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16706743836402893},{"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":1,"locations":[{"id":"doi:10.2307/2272825","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272825","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W568910110","https://openalex.org/W1589181275","https://openalex.org/W1983811943","https://openalex.org/W2089947806","https://openalex.org/W2554842236","https://openalex.org/W6672807822","https://openalex.org/W6826215695"],"related_works":["https://openalex.org/W2001962035","https://openalex.org/W1408600649","https://openalex.org/W1862936125","https://openalex.org/W2467957161","https://openalex.org/W2172247778","https://openalex.org/W2914940747","https://openalex.org/W4247035339","https://openalex.org/W2359098868","https://openalex.org/W1981029600","https://openalex.org/W2082255271"],"abstract_inverted_index":{"Several":[0],"new":[1],"features":[2],"arise":[3],"in":[4,69,119,148],"the":[5,30,70,194,238,241],"generalization":[6],"of":[7,27,32,38,73,82,93,107,172,196,213,220,240],"recursion":[8,13,75],"theory":[9,14,22,76],"on":[10,15],"\u03c9":[11],"to":[12,152,193],"admissible":[16],"ordinals":[17],"\u03b1,":[18],"thus":[19],"making":[20,185],"\u03b1-recursion":[21],"an":[23,139,198,218],"interesting":[24],"theory.":[25],"One":[26],"these":[28],"is":[29,40,63,84,89,123,137,143,174,189,202,217,228,237],"appearance":[31],"irregular":[33,65],"sets.":[34],"A":[35,37,54,62,99,142,169,173,188,201,214,221,227],"subset":[36,81],"\u03b1":[39,52,59,83,88,101,130,197,225],"called":[41,64],"regular":[42,190,203],"(over":[43,66],"\u03b1),":[44],"if":[45,87,111,161],"we":[46,95,112,162,234],"have":[47,235],"for":[48,184,205,209],"all":[49],"\u03b2":[50,171],"<":[51],"that":[53,138,165,187,236],"\u2229":[55,170],"B":[56],"\u2208":[57],"L":[58,94,129],",":[60],"otherwise":[61],"\u03b1).":[67],"So":[68],"special":[71],"case":[72],"ordinary":[74],"(\u03b1":[77],"=":[78],"\u03c9)":[79],"every":[80,166,206],"regular,":[85],"but":[86],"not":[90],"a":[91],"cardinal":[92],"find":[96],"constructible":[97],"sets":[98,118],"\u2286":[100],"which":[102,149],"are":[103],"irregular.":[104],"The":[105,132],"notion":[106],"regularity":[108],"becomes":[109],"essential,":[110],"deal":[113],"with":[114],"\u03b1-recursively":[115],"enumerable":[116],"(\u03b1-r.e.)":[117],"priority":[120],"constructions":[121],"(\u03b1-r.e.":[122],"defined":[124],"as":[125],"\u03a3":[126],"1":[127],"over":[128],").":[131,246],"typical":[133],"situation":[134],"occurring":[135],"there":[136],"\u03b1-r.e.":[140,199],"set":[141,200,242],"enumerated":[144,176],"during":[145],"some":[146,178],"construction":[147,158],"one":[150],"tries":[151],"satisfy":[153],"certain":[154],"requirements.":[155],"Often":[156],"this":[157],"succeeds":[159],"only":[160],"can":[163],"insure":[164],"initial":[167],"segment":[168],"completely":[175],"at":[177],"stage":[179],"before":[180],"\u03b1.":[181],"This":[182],"calls":[183],"sure":[186],"because":[191],"due":[192],"admissibility":[195],"iff":[204,222],"(or":[207],"equivalently":[208],"one)":[210],"enumeration":[211,219],"f":[212,216,223,245],"(":[215],":":[224],"\u2192":[226],"\u03b1-recursive,":[229],"total,":[230],"1-1":[231],"and":[232],"onto)":[233],"image":[239],"\u03c3":[243],"under":[244]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}