{"id":"https://openalex.org/W1981184771","doi":"https://doi.org/10.2307/2964015","title":"On recursively enumerable and arithmetic models of set theory","display_name":"On recursively enumerable and arithmetic models of set theory","publication_year":1958,"publication_date":"1958-12-01","ids":{"openalex":"https://openalex.org/W1981184771","doi":"https://doi.org/10.2307/2964015","mag":"1981184771"},"language":"en","primary_location":{"id":"doi:10.2307/2964015","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2964015","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/A5110849557","display_name":"Michael O. Rabin","orcid":null},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]},{"id":"https://openalex.org/I4210102560","display_name":"Israel Institute for Advanced Studies","ror":"https://ror.org/01140r423","country_code":"IL","type":"facility","lineage":["https://openalex.org/I4210102560"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michael O. Rabin","raw_affiliation_strings":["Institute for Advanced Study and the Hebrew University, Jerusalem","Institute for Advanced Study and the Hebrew University"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study and the Hebrew University, Jerusalem","institution_ids":["https://openalex.org/I4210102560"]},{"raw_affiliation_string":"Institute for Advanced Study and the Hebrew University","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110849557"],"corresponding_institution_ids":["https://openalex.org/I197251160","https://openalex.org/I4210102560"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.08492569,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"4","first_page":"408","last_page":"416"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9976999759674072,"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"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9976999759674072,"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/T10258","display_name":"Philosophy and Theoretical Science","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/3205","display_name":"Experimental and Cognitive Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9934999942779541,"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/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.9454643726348877},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.818799614906311},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.7932274341583252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.627514660358429},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.6186802983283997},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5633863806724548},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.5505490899085999},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5163439512252808},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4700336158275604},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.4608262777328491},{"id":"https://openalex.org/keywords/model-theory","display_name":"Model theory","score":0.45083439350128174},{"id":"https://openalex.org/keywords/theory","display_name":"Theory","score":0.4385386109352112},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4212890863418579},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4129326045513153},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2311815619468689}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.9454643726348877},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.818799614906311},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.7932274341583252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.627514660358429},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.6186802983283997},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5633863806724548},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.5505490899085999},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5163439512252808},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4700336158275604},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.4608262777328491},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.45083439350128174},{"id":"https://openalex.org/C144701195","wikidata":"https://www.wikidata.org/wiki/Q10859910","display_name":"Theory","level":2,"score":0.4385386109352112},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4212890863418579},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4129326045513153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2311815619468689},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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/2964015","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2964015","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/1183733414","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183733414","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":[{"score":0.4300000071525574,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1483568252","https://openalex.org/W1781706428","https://openalex.org/W2021043088","https://openalex.org/W2620105238","https://openalex.org/W3209909200","https://openalex.org/W4244122849"],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W1972481159","https://openalex.org/W1973052363","https://openalex.org/W1980641386","https://openalex.org/W2094468224","https://openalex.org/W4249600134","https://openalex.org/W2757989085","https://openalex.org/W2135152748","https://openalex.org/W1989224212","https://openalex.org/W2185077833"],"abstract_inverted_index":{"In":[0],"this":[1,20,68,155],"note":[2],"we":[3,84,129],"shall":[4],"prove":[5],"a":[6,78,86,132,139,143],"certain":[7,40,55],"relative":[8],"recursiveness":[9],"lemma":[10,21],"concerning":[11],"countable":[12],"models":[13],"of":[14,29,44,50,81,98,101,105,108,138,160,165],"set":[15,45,113,166],"theory":[16,114],"(Lemma":[17],"5).":[18],"From":[19],"will":[22],"follow":[23],"two":[24],"results":[25],"about":[26],"special":[27],"types":[28],"such":[30],"models.":[31,63,76],"Kreisel":[32],"[5]":[33],"and":[34,54,103],"Mostowski":[35],"[6]":[36],"have":[37],"shown":[38],"that":[39],"(finitely":[41,162],"axiomatized)":[42],"systems":[43],"theory,":[46],"formulated":[47],"by":[48],"means":[49],"the":[51,96,99,109,116,158,161],"\u03f5":[52,120],"relation":[53,146],"additional":[56],"non-logical":[57,118],"constants,":[58],"do":[59],"not":[60,90,122,149],"possess":[61,123,150],"recursive":[62,75],"Their":[64],"purpose":[65],"in":[66],"doing":[67],"was":[69],"to":[70],"construct":[71],"consistent":[72,140],"sentences":[73],"without":[74],"As":[77],"first":[79],"corollary":[80],"Lemma":[82],"5,":[83],"obtain":[85],"very":[87],"simple":[88],"proof,":[89],"involving":[91],"any":[92,124,151],"formal":[93],"constructions":[94],"within":[95],"system":[97],"notions":[100],"truth":[102],"satisfiability,":[104],"an":[106,135],"extension":[107],"Kreisel-Mostowski":[110],"theorems.":[111],"Namely,":[112],"with":[115],"single":[117,144],"constant":[119],"does":[121,148],"recursively":[125,152],"enumerable":[126,153],"model.":[127],"Thus":[128],"get,":[130],"as":[131],"side":[133],"product,":[134],"easy":[136],"example":[137],"sentence":[141,156],"containing":[142],"binary":[145],"which":[147],"model;":[154],"being":[157],"conjunction":[159],"many)":[163],"axioms":[164],"theory.":[167]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}