{"id":"https://openalex.org/W2131524578","doi":"https://doi.org/10.2307/2273290","title":"A new omitting types theorem for <i>L(Q)</i>","display_name":"A new omitting types theorem for <i>L(Q)</i>","publication_year":1979,"publication_date":"1979-12-01","ids":{"openalex":"https://openalex.org/W2131524578","doi":"https://doi.org/10.2307/2273290","mag":"2131524578"},"language":"en","primary_location":{"id":"doi:10.2307/2273290","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273290","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/A5004178046","display_name":"Matt Kaufmann","orcid":"https://orcid.org/0009-0004-5667-4888"},"institutions":[{"id":"https://openalex.org/I1304256225","display_name":"University of Wisconsin System","ror":"https://ror.org/03ydkyb10","country_code":"US","type":"education","lineage":["https://openalex.org/I1304256225"]},{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matt Kaufmann","raw_affiliation_strings":["Purdue University, W. Lafayette, Indiana 47907","Universtiy of Wisconsin, Madison, Wisconsin 53706"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, W. Lafayette, Indiana 47907","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Universtiy of Wisconsin, Madison, Wisconsin 53706","institution_ids":["https://openalex.org/I1304256225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004178046"],"corresponding_institution_ids":["https://openalex.org/I1304256225","https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2736411,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"44","issue":"4","first_page":"507","last_page":"521"},"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.9994999766349792,"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.9994999766349792,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9955999851226807,"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.9950000047683716,"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/countable-set","display_name":"Countable set","score":0.8598864674568176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7836621999740601},{"id":"https://openalex.org/keywords/g\u00f6dels-completeness-theorem","display_name":"G\u00f6del's completeness theorem","score":0.6780582070350647},{"id":"https://openalex.org/keywords/compactness-theorem","display_name":"Compactness theorem","score":0.6194973587989807},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.5603029131889343},{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.5556572675704956},{"id":"https://openalex.org/keywords/model-theory","display_name":"Model theory","score":0.54093337059021},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5221312642097473},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5098956823348999},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.503654420375824},{"id":"https://openalex.org/keywords/uncountable-set","display_name":"Uncountable set","score":0.4970243275165558},{"id":"https://openalex.org/keywords/fixed-point-theorem","display_name":"Fixed-point theorem","score":0.411314994096756},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37994644045829773},{"id":"https://openalex.org/keywords/fundamental-theorem","display_name":"Fundamental theorem","score":0.30892783403396606},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2947642505168915},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11812496185302734},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.10092905163764954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06427383422851562},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05563279986381531}],"concepts":[{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.8598864674568176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7836621999740601},{"id":"https://openalex.org/C200116569","wikidata":"https://www.wikidata.org/wiki/Q902052","display_name":"G\u00f6del's completeness theorem","level":2,"score":0.6780582070350647},{"id":"https://openalex.org/C171636804","wikidata":"https://www.wikidata.org/wiki/Q1149458","display_name":"Compactness theorem","level":4,"score":0.6194973587989807},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.5603029131889343},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.5556572675704956},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.54093337059021},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5221312642097473},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5098956823348999},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.503654420375824},{"id":"https://openalex.org/C142399903","wikidata":"https://www.wikidata.org/wiki/Q1128796","display_name":"Uncountable set","level":3,"score":0.4970243275165558},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.411314994096756},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37994644045829773},{"id":"https://openalex.org/C194886279","wikidata":"https://www.wikidata.org/wiki/Q430271","display_name":"Fundamental theorem","level":3,"score":0.30892783403396606},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2947642505168915},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11812496185302734},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.10092905163764954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06427383422851562},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05563279986381531},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"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":1,"locations":[{"id":"doi:10.2307/2273290","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273290","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2054770471","https://openalex.org/W2066633462","https://openalex.org/W2080309222","https://openalex.org/W2094084820","https://openalex.org/W2799061192","https://openalex.org/W4210589687","https://openalex.org/W7039996565"],"related_works":["https://openalex.org/W4210443013","https://openalex.org/W2360668589","https://openalex.org/W2550969341","https://openalex.org/W1865743830","https://openalex.org/W965345433","https://openalex.org/W2499036894","https://openalex.org/W2131524578","https://openalex.org/W1176213484","https://openalex.org/W2481922523","https://openalex.org/W4387724350"],"abstract_inverted_index":{"For":[0],"L":[1],"a":[2,24,48,54,60,71,115,135,176],"countable":[3,56,72],"first-order":[4,87],"language,":[5],"let":[6],"L(Q)":[7,39,77,182],"be":[8,179],"logic":[9],"with":[10,27,184],"the":[11,86],"quantifier":[12],"Qx":[13],"which":[14,131],"means":[15],"\u201cthere":[16],"exist":[17],"uncountably":[18],"many":[19],"x":[20,64,66],"\u201d.":[21],"We":[22],"assume":[23],"little":[25],"familiarity":[26],"Keisler's":[28,124],"paper":[29],"[8].":[30],"One":[31],"finds":[32],"there":[33],"completeness":[34],"and":[35,82,94,104,107,167],"compactness":[36],"theorems":[37],"for":[38,53,85,111,134,181],",":[40,155],"as":[41,43,144],"well":[42],"an":[44,121],"omitting":[45,88],"types":[46,89],"theorem:":[47],"syntactic":[49],"condition":[50],"is":[51,70,99,125,196],"given":[52,130],"consistent":[55],"theory":[57,136],"to":[58,92,123,138],"have":[59,139],"model":[61],"satisfying":[62,141],"\u2200":[63,160],"\u22c1\u03a3(":[65,152],"),":[67,159,166],"where":[68,193],"\u03a3":[69],"set":[73],"of":[74,76],"formulas":[75],".":[78,183],"(See":[79],"also":[80],"Chang":[81],"Keisler":[83],"[3]":[84],"theorem,":[90],"due":[91],"Henkin":[93],"Orey.)":[95],"An":[96],"analogous":[97],"theorem":[98,118,177],"proved":[100,126,180],"in":[101,108],"Barwise,":[102],"Kaufmann,":[103],"Makkai":[105],"[1]":[106],"Kaufmann":[109],"[6]":[110],"stationary":[112],"logic.":[113],"However,":[114],"more":[116],"general":[117],"than":[119],"just":[120],"anlaogue":[122],"there.":[127],"Conditions":[128],"are":[129,132],"sufficient":[133],"T":[137],"models":[140],"sentences":[142],"such":[143,175],"aas":[145,147,150],"1":[146,154],"2":[148],"\u2026":[149,156],"n":[151,158],"s":[153,157,165],"xaas":[161],"\u2228":[162],"\u03a3(":[163],"x,":[164],"so":[168],"forth.":[169],"Bruce":[170],"[2]":[171],"had":[172],"asked":[173],"whether":[174],"can":[178],"\u201c":[185,190],"aa":[186],"\u201d":[187],"replaced":[188],"by":[189],"Q":[191,194,198],"*\u201d,":[192],"*":[195],"\u00ac":[197,199],"(\u201cfor":[200],"all":[201],"but":[202],"countably":[203],"many\u201d).":[204]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}