{"id":"https://openalex.org/W2114727102","doi":"https://doi.org/10.2307/2271985","title":"A converse of the Barwise completeness theorem","display_name":"A converse of the Barwise completeness theorem","publication_year":1973,"publication_date":"1973-12-01","ids":{"openalex":"https://openalex.org/W2114727102","doi":"https://doi.org/10.2307/2271985","mag":"2114727102"},"language":"en","primary_location":{"id":"doi:10.2307/2271985","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2271985","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/A5019899729","display_name":"Jonathan Stavi","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"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Jonathan Stavi","raw_affiliation_strings":["Hebrew University, Jerusalem, Israel","Hebrew University , Jerusalem, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"Hebrew University , Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019899729"],"corresponding_institution_ids":["https://openalex.org/I197251160"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.27737226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"38","issue":"4","first_page":"594","last_page":"612"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9983000159263611,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9983000159263611,"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.998199999332428,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.998199999332428,"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/mathematics","display_name":"Mathematics","score":0.7735668420791626},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6643357276916504},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6215945482254028},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6118776202201843},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5993489027023315},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.5891631841659546},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.502962052822113},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4955493211746216},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.49267369508743286},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.47116050124168396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4599210023880005},{"id":"https://openalex.org/keywords/g\u00f6dels-completeness-theorem","display_name":"G\u00f6del's completeness theorem","score":0.4239486753940582}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7735668420791626},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6643357276916504},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6215945482254028},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6118776202201843},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5993489027023315},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.5891631841659546},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.502962052822113},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4955493211746216},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.49267369508743286},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.47116050124168396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4599210023880005},{"id":"https://openalex.org/C200116569","wikidata":"https://www.wikidata.org/wiki/Q902052","display_name":"G\u00f6del's completeness theorem","level":2,"score":0.4239486753940582},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2271985","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2271985","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/1183738860","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183738860","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W65053296","https://openalex.org/W198973586","https://openalex.org/W1907692615","https://openalex.org/W1991402517","https://openalex.org/W2021757832","https://openalex.org/W2048873161","https://openalex.org/W2131495252","https://openalex.org/W4291439952"],"related_works":["https://openalex.org/W1553139688","https://openalex.org/W2371151875","https://openalex.org/W2136009070","https://openalex.org/W2362009423","https://openalex.org/W2391133415","https://openalex.org/W2012063573","https://openalex.org/W1982015164","https://openalex.org/W203725150","https://openalex.org/W4230967508","https://openalex.org/W1499233953"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2,86],"a":[3,59,63,71,113,173,181,230,253],"converse":[4],"of":[5,42,81,107,137,140,146,155,175,180],"Barwise's":[6,46,85],"completeness":[7,47],"theorem":[8,48],"is":[9,35,58,93,102,120,158,172,183,201,250,265],"proved":[10],"by":[11,185],"cut-elimination":[12],"considerations":[13],"applied":[14],"to":[15,151,160,168,218,251],"inductive":[16],"definitions.":[17],"We":[18,215],"show":[19,216],"that":[20,53,162,170,234,240],"among":[21],"the":[22,40,50,66,79,82,91,105,108,135],"transitive":[23,114,122],"sets":[24,44],"T":[25,57,74,111,164,171,200,205,212,221,256,259,274],"satisfying":[26],"some":[27],"weak":[28],"closure":[29,138],"conditions":[30],"(closure":[31],"under":[32,125],"primitive-recursive":[33],"set-functions":[34],"more":[36],"than":[37],"enough),":[38],"only":[39],"unions":[41],"admissible":[43,176],"satisfy":[45],"in":[49,73,84,104,166,211,220,224,255],"form":[51],"stating":[52],"if":[54,248],"\u03c6":[55,69],"\u220a":[56,192],"sentence":[60,232],"which":[61],"has":[62,70,235],"derivation":[64,72,237,254],"(in":[65,222],"universe)":[67],"then":[68],".":[75,246,263],"See":[76],"\u00a71":[77],"for":[78],"origin":[80],"problem":[83],"[Ba].":[87],"Stated":[88],"quite":[89],"briefly":[90],"proof":[92],"as":[94],"follows":[95],"(a":[96],"step-by-step":[97],"account":[98],"including":[99],"relevant":[100],"definitions":[101],"given":[103],"body":[106],"paper):":[109],"Let":[110,214],"be":[112,134],"prim.-rec.":[115,202],"closed":[116,124],"set,":[117],"and":[118,123],"let":[119,129],"nonempty,":[121],"pairs}.":[126],"For":[127],"each":[128],"\u03ba":[130,268,277],"(":[131,227,269,278],"A":[132,147,228,270,279],")":[133,165,188,196,206,243,260,275],"supremum":[136],"ordinals":[139],"first-order":[141],"positive":[142],"operators":[143],"on":[144],"subsets":[145],"(first-order":[148],"with":[149],"respect":[150],"By":[152],"Theorem":[153],"1":[154],"[BGM],":[156],"it":[157],"enough":[159],"prove":[161],"rank(":[163,186,204,241,258,273],"order":[167],"obtain":[169],"union":[174],"sets.":[177],"(The":[178],"rank":[179],"set":[182],"defined":[184],"x":[187,193],"=":[189,207],"sup":[190],"y":[191,195],"(rank(":[194],"+":[197],"1);":[198],"since":[199],"closed,":[203],"smallest":[208],"ordinal":[209],"not":[210],".)":[213],"how":[217],"find":[219],"fact,":[223],"L":[225],"\u03c9":[226],"))":[229],"derivable":[231],"\u03c4":[233,249],"no":[236],"D":[238,242],"such":[239],"\u2264":[244],"\u03b1":[245,262,264],"Thus,":[247],"have":[252],",":[257],">":[261],"arbitrary":[266],"(<":[267],")),":[271],"so":[272],"\u2265":[276],").":[280],"Q.E.D.":[281]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}