{"id":"https://openalex.org/W2039687554","doi":"https://doi.org/10.2307/2274481","title":"Effective model theory vs. recursive model theory","display_name":"Effective model theory vs. recursive model theory","publication_year":1990,"publication_date":"1990-09-01","ids":{"openalex":"https://openalex.org/W2039687554","doi":"https://doi.org/10.2307/2274481","mag":"2039687554"},"language":"en","primary_location":{"id":"doi:10.2307/2274481","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2274481","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/A5010219642","display_name":"John Chisholm","orcid":null},"institutions":[{"id":"https://openalex.org/I117942362","display_name":"Western Illinois University","ror":"https://ror.org/02sshz518","country_code":"US","type":"education","lineage":["https://openalex.org/I117942362"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John Chisholm","raw_affiliation_strings":["Department of Mathematics, Western Illinois University, Macomb, Illinois 61455"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Western Illinois University, Macomb, Illinois 61455","institution_ids":["https://openalex.org/I117942362"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010219642"],"corresponding_institution_ids":["https://openalex.org/I117942362"],"apc_list":null,"apc_paid":null,"fwci":0.5371,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.7379479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"55","issue":"3","first_page":"1168","last_page":"1191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9041000008583069,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9041000008583069,"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.9007999897003174,"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/converse","display_name":"Converse","score":0.7732384204864502},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6550487875938416},{"id":"https://openalex.org/keywords/model-theory","display_name":"Model theory","score":0.6469319462776184},{"id":"https://openalex.org/keywords/computability-theory","display_name":"Computability theory","score":0.620501697063446},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38837921619415283},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3220036029815674}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.7732384204864502},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6550487875938416},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.6469319462776184},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.620501697063446},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38837921619415283},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3220036029815674},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2274481","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2274481","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/1183743413","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183743413","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/W65053296","https://openalex.org/W2044797614","https://openalex.org/W2047865735","https://openalex.org/W2146750910","https://openalex.org/W2530006810","https://openalex.org/W2905135108"],"related_works":["https://openalex.org/W2753380948","https://openalex.org/W2330050861","https://openalex.org/W2332136239","https://openalex.org/W2376429153","https://openalex.org/W3035687845","https://openalex.org/W1997434166","https://openalex.org/W1509142742","https://openalex.org/W2064847051","https://openalex.org/W2039687554","https://openalex.org/W618137504"],"abstract_inverted_index":{"Recursive":[0],"model":[1,17,67,89,217,225,265,275],"theory":[2,276],"is":[3,36,80,101,110,115,134,153,172,230],"supposed":[4],"to":[5,37,40,143,212,231,237,241,244],"be":[6,144,242],"the":[7,10,52,57,94,141,170,178,214,245,248,252,261,272,279],"study":[8],"of":[9,12,25,33,99,105,164,187,216,247,278,281],"effectiveness":[11,215],"constructions":[13],"and":[14,43,61,69,166],"theorems":[15],"in":[16,56,97,156,161,258],"theory.":[18],"This":[19],"often":[20],"involves":[21],"getting":[22],"\u201ceffective\u201d":[23],"versions":[24],"various":[26],"classical":[27],"model-theoretic":[28],"notions.":[29],"The":[30,227],"traditional":[31],"way":[32],"doing":[34],"this":[35,204],"restrict":[38],"attention":[39],"recursive":[41,44,66,88,264],"models,":[42,235],"isomorphisms":[45],"between":[46],"them,":[47],"etc.":[48],"Thus":[49,267],"for":[50,86,140,268],"example":[51,269],"following":[53,273],"definition":[54],"appears":[55],"literature":[58],"(in":[59],"[3]":[60],"[1]).":[62],"Definition.":[63],"Given":[64],"a":[65,74,118,157,162,196,208],"A":[68,78,92,130],"an":[70,102,219],"n":[71,79,107],"\u0404":[72],"\u03c9,":[73],"subset":[75,104],"R":[76,100,114,133,151],"\u2286":[77],"called":[81],"intrinsically":[82,135,188,283],"r.e.":[83,103,136,189,284],"provided":[84,147],"that":[85,112,148],"every":[87],"B":[90,98,106],"\u2248":[91],",":[93],"isomorphic":[95],"image":[96],".":[108],"It":[109,137],"clear":[111],"if":[113,175],"definable":[116,194],"by":[117,195],"(recursive,":[119],"infinitary)":[120],"\u03a3":[121,197],"1":[122,198],"0":[123,199],"formula":[124,200],"(with":[125],"finitely":[126],"many":[127],"parameters":[128],"from":[129],"),":[131],"then":[132],"seems":[138],"natural":[139],"converse":[142,171],"true.":[145,173],"Indeed,":[146],"(":[149],"A,":[150],")":[152],"sufficiently":[154],"\u201cregular\u201d":[155],"sense":[158],"made":[159],"precise":[160],"theorem":[163],"Ash":[165],"Nerode":[167],"(see":[168,201],"[3]),":[169],"However,":[174],"we":[176,206,221,270],"drop":[177],"(rather":[179],"strong)":[180],"regularity":[181],"conditions,":[182],"there":[183],"exist":[184],"\u201cpathological\u201d":[185],"examples":[186],"relations":[190],"which":[191],"are":[192],"not":[193],"[7]).":[202],"In":[203],"paper,":[205],"suggest":[207],"rather":[209],"different":[210],"approach":[211,220],"studying":[213],"theory,":[218],"have":[222,271],"dubbed":[223],"\u201ceffective":[224],"theory\u201d.":[226],"basic":[228],"idea":[229],"allow":[232],"arbitrary":[233],"nonrecursive":[234],"but":[236],"require":[238],"all":[239],"notions":[240],"relativized":[243],"complexity":[246],"models":[249],"involved.":[250],"(Much":[251],"same":[253],"notion":[254],"has":[255],"been":[256],"used":[257],"[2]":[259],"under":[260],"name":[262],"\u201crelatively":[263],"theory\u201d.)":[266],"effective":[274],"version":[277],"property":[280],"being":[282]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}