{"id":"https://openalex.org/W2049591942","doi":"https://doi.org/10.2307/2273123","title":"A complete, decidable theory with two decidable models","display_name":"A complete, decidable theory with two decidable models","publication_year":1979,"publication_date":"1979-09-01","ids":{"openalex":"https://openalex.org/W2049591942","doi":"https://doi.org/10.2307/2273123","mag":"2049591942"},"language":"en","primary_location":{"id":"doi:10.2307/2273123","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273123","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/A5080658709","display_name":"Terrence Millar","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Terrence S. Millar","raw_affiliation_strings":["Kantor Pos, Watansoppeng, Selawesi Selatan, Indonesia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kantor Pos, Watansoppeng, Selawesi Selatan, Indonesia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080658709"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.10408618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"44","issue":"3","first_page":"307","last_page":"312"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.994700014591217,"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.994700014591217,"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.9941999912261963,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9905999898910522,"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/decidability","display_name":"Decidability","score":0.9761785268783569},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.7801016569137573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.642827570438385},{"id":"https://openalex.org/keywords/model-theory","display_name":"Model theory","score":0.6201227903366089},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.580614447593689},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5593516230583191},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5514272451400757},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16463720798492432}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9761785268783569},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.7801016569137573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.642827570438385},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.6201227903366089},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.580614447593689},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5593516230583191},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5514272451400757},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16463720798492432},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2273123","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273123","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/1183740426","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183740426","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":7,"referenced_works":["https://openalex.org/W1593399533","https://openalex.org/W1816556148","https://openalex.org/W1987148015","https://openalex.org/W2084068730","https://openalex.org/W2530006810","https://openalex.org/W2799061192","https://openalex.org/W2905135108"],"related_works":["https://openalex.org/W2067699663","https://openalex.org/W2101752691","https://openalex.org/W2125305054","https://openalex.org/W2108448248","https://openalex.org/W2049591942","https://openalex.org/W2919828861","https://openalex.org/W2021891065","https://openalex.org/W4288482050","https://openalex.org/W3119991094","https://openalex.org/W2084068730"],"abstract_inverted_index":{"A":[0,36],"well-known":[1],"result":[2,18,115],"of":[3,19,68,82,97,116,126,146,161,171,180,184,199,202,241,244],"Vaught's":[4],"is":[5,22,25,38,137,157,164,225,237],"that":[6,23,168,223],"no":[7],"complete":[8,27,227],"theory":[9,29,216,229],"has":[10,42,217],"exactly":[11,31],"two":[12,32],"nonisomorphic":[13,33],"countable":[14,80],"models.":[15,35],"The":[16],"main":[17],"this":[20],"paper":[21],"there":[24],"a":[26,43,54,79,91,119,158,172,196,218,226],"decidable":[28,34,39,44,55,138,214,219,228],"with":[30],"model":[37,81,173],"if":[40],"it":[41],"satisfaction":[45],"predicate.":[46],"To":[47],"be":[48,53,64,78],"more":[49],"precise,":[50],"let":[51,57,77,109],"T":[52,74,83,107,190,224,247],"theory,":[56],"{\u03b8":[58,231],"n":[59,61,150,154,232,234],"\u2223":[60,93,98,147,151,233],"<":[62,95,134,235],"\u03c9}":[63,96,236],"an":[65,238],"effective":[66,182,239],"enumeration":[67,183,240],"all":[69,242],"formulas":[70,186,243],"in":[71,131,140,187],"L":[72,105,188,245],"(":[73,106,189,246],"),":[75,108],"and":[76,100,230],".":[84],"For":[85],"any":[86,101],"indexing":[87,144],"E":[88,111,145,155],"=":[89],"{":[90,149],"i":[92,94,120,129,133],"\u2223,":[99,148],"formula":[102],"\u03d5":[103],"\u2208":[104],"\u2018\u03d5":[110],"\u2019":[112,121,130],"denote":[113],"the":[114,169,178,181,185,203],"substituting":[117],"\u2018":[118,127],"for":[122,142],"every":[123],"free":[124],"occurrence":[125],"x":[128],"\u03d5,":[132],"\u03c9.":[135],"Then":[136],"just":[139],"case,":[141],"some":[143],"\u22a8":[152],"\u03b8":[153],"}":[156],"recursive":[159],"set":[160],"integers.":[162],"It":[163],"easy":[165],"to":[166],"show":[167],"decidability":[170],"does":[174],"not":[175],"depend":[176],"on":[177],"choice":[179],");":[191],"we":[192,209],"omit":[193],"details.":[194],"By":[195],"simple":[197],"\u2018effectivization\u2019":[198],"Henkin's":[200],"proof":[201],"completeness":[204],"theorem":[205],"(see":[206],"Chang":[207],"[1])":[208],"have":[210],"Fact":[211],"1.":[212],"Every":[213],"consistent":[215],"model.":[220],"Assume":[221],"next":[222],").":[248]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}