{"id":"https://openalex.org/W1514878292","doi":"https://doi.org/10.2307/2272413","title":"<i>\u03b1</i>-degrees of <i>\u03b1</i>-theories","display_name":"<i>\u03b1</i>-degrees of <i>\u03b1</i>-theories","publication_year":1972,"publication_date":"1972-12-01","ids":{"openalex":"https://openalex.org/W1514878292","doi":"https://doi.org/10.2307/2272413","mag":"1514878292"},"language":"en","primary_location":{"id":"doi:10.2307/2272413","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272413","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/A5011700794","display_name":"G. Metakides","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"George Metakides","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","Massachusetts Institute of Technology Cambridge, Massachusetts 02139"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011700794"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.07074865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"4","first_page":"677","last_page":"682"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9970999956130981,"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/T11567","display_name":"semigroups and automata theory","score":0.9970999956130981,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9962000250816345,"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.995199978351593,"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/countable-set","display_name":"Countable set","score":0.7370588779449463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6731969118118286},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.628267765045166},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5802034139633179},{"id":"https://openalex.org/keywords/computability-theory","display_name":"Computability theory","score":0.5502462983131409},{"id":"https://openalex.org/keywords/partial-function","display_name":"Partial function","score":0.5320355296134949},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4898488223552704},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.47049710154533386},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4440745413303375},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.4431685507297516},{"id":"https://openalex.org/keywords/theory","display_name":"Theory","score":0.43402737379074097},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4161120355129242},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3456447720527649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17891836166381836},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12171876430511475}],"concepts":[{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.7370588779449463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6731969118118286},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.628267765045166},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5802034139633179},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.5502462983131409},{"id":"https://openalex.org/C182359184","wikidata":"https://www.wikidata.org/wiki/Q1756942","display_name":"Partial function","level":2,"score":0.5320355296134949},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4898488223552704},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.47049710154533386},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4440745413303375},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.4431685507297516},{"id":"https://openalex.org/C144701195","wikidata":"https://www.wikidata.org/wiki/Q10859910","display_name":"Theory","level":2,"score":0.43402737379074097},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4161120355129242},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3456447720527649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17891836166381836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12171876430511475},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2307/2272413","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272413","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":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W213603931","https://openalex.org/W1526907582","https://openalex.org/W1990063332","https://openalex.org/W2022263458","https://openalex.org/W2131495252","https://openalex.org/W2135002906","https://openalex.org/W2498536233","https://openalex.org/W4236888313","https://openalex.org/W4245875350","https://openalex.org/W4296119740"],"related_works":["https://openalex.org/W4388310202","https://openalex.org/W2310420552","https://openalex.org/W2133902039","https://openalex.org/W1589207578","https://openalex.org/W2936847277","https://openalex.org/W167110062","https://openalex.org/W2001962035","https://openalex.org/W4247035339","https://openalex.org/W1161578261","https://openalex.org/W2467957161"],"abstract_inverted_index":{"Let":[0],"\u03b1":[1,21,27,29,52,61,64,67],"be":[2,38,47],"a":[3,16,35,43,186,199,219],"limit":[4],"ordinal":[5],"with":[6],"the":[7,57,72,80,99,103,129,163,170,182,190],"property":[8],"that":[9,132,148,206],"any":[10],"\u201crecursive\u201d":[11],"function":[12],"whose":[13],"domain":[14],"is":[15,30,214],"proper":[17],"initial":[18],"segment":[19],"of":[20,60,78,105,110,165,172,189,192,222],"has":[22],"its":[23,83],"range":[24],"bounded":[25],"by":[26,55,117],".":[28],"then":[31],"called":[32],"admissible":[33,195,201,223],"(in":[34],"sense":[36],"to":[37,74,86,169,184,193,204],"made":[39,162],"precise":[40],"later)":[41],"and":[42,66,93,124,147,203,208],"recursion":[44,167],"theory":[45,168],"can":[46],"developed":[48],"on":[49,98],"it":[50],"(":[51,197],"-recursion":[53],"theory)":[54],"providing":[56],"generalized":[58,158,166],"notions":[59],"-recursively":[62],"enumerable,":[63],"-recursive":[65],"-finite.":[68],"Takeuti":[69],"[12]":[70],"was":[71,113,181],"first":[73,183],"study":[75,104],"recursive":[76],"functions":[77],"ordinals,":[79],"subject":[81],"owing":[82],"further":[84],"development":[85],"Kripke":[87],"[7],":[88],"Platek":[89],"[8],":[90],"Kreisel":[91,126],"[6],":[92],"Sacks":[94],"[9].":[95],"Infinitary":[96],"logic":[97,171],"other":[100],"hand":[101],"(i.e.,":[102],"languages":[106,134,174],"which":[107,136,154],"allow":[108,152],"expressions":[109,139,153],"infinite":[111],"length)":[112],"quite":[114],"extensively":[115],"studied":[116],"Scott":[118],"[11],":[119],"Tarski,":[120],"Kreisel,":[121],"Karp":[122],"[5]":[123],"others.":[125],"suggested":[127],"in":[128,156],"late":[130],"'50's":[131],"these":[133],"(even":[135],"allows":[137],"countable":[138,200],"but":[140],"only":[141,151],"finite":[142],"quantification)":[143],"were":[144],"too":[145],"large":[146],"one":[149],"should":[150],"are,":[155],"some":[157],"sense,":[159],"finite.":[160],"This":[161],"application":[164],"infinitary":[173],"appear":[175],"natural.":[176],"In":[177],"1967":[178],"Barwise":[179],"[1]":[180],"present":[185],"complete":[187],"formalization":[188],"restriction":[191],"an":[194,215],"fragment":[196],"A":[198],"set)":[202],"prove":[205],"completeness":[207],"compactness":[209],"hold":[210],"for":[211,218],"it.":[212],"[2]":[213],"excellent":[216],"reference":[217],"detailed":[220],"exposition":[221],"languages.":[224]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}