{"id":"https://openalex.org/W2131524578","doi":"https://doi.org/10.2307/2273290","title":"A new omitting types theorem for L(Q)","display_name":"A new omitting types theorem for L(Q)","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":2,"corresponding_author_ids":["https://openalex.org/A5004178046"],"corresponding_institution_ids":["https://openalex.org/I1304256225","https://openalex.org/I219193219"],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27217125,"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,23,46,52,58,65,108,128,156],"countable":[3,54,66],"first-order":[4,80],"language,":[5],"let":[6],"L(Q)":[7],"be":[8,159],"logic":[9],"with":[10,26,163],"the":[11,79],"quantifier":[12],"Qx":[13],"which":[14,124],"means":[15],"\u201cthere":[16],"exist":[17],"uncountably":[18],"many":[19],"x\u201d.":[20],"We":[21],"assume":[22],"little":[24],"familiarity":[25],"Keisler's":[27,117],"paper":[28],"[8].":[29],"One":[30],"finds":[31],"there":[32],"completeness":[33],"and":[34,75,87,97,100,147],"compactness":[35],"theorems":[36],"for":[37,51,78,104,127,161],"L(Q),":[38],"as":[39,41,137],"well":[40],"an":[42,114],"omitting":[43,81],"types":[44,82],"theorem:":[45],"syntactic":[47],"condition":[48],"is":[49,64,92,118,170],"given":[50,123],"consistent":[53],"theory":[55,129],"to":[56,85,116,131],"have":[57,132],"model":[59],"satisfying":[60,134],"\u2200x\u22c1\u03a3(x),":[61],"where":[62,168],"\u03a3":[63],"set":[67],"of":[68,70],"formulas":[69],"L(Q).":[71,162],"(See":[72],"also":[73],"Chang":[74],"Keisler":[76],"[3]":[77],"theorem,":[83],"due":[84],"Henkin":[86],"Orey.)":[88],"An":[89],"analogous":[90],"theorem":[91,111,157],"proved":[93,119,160],"in":[94,101],"Barwise,":[95],"Kaufmann,":[96],"Makkai":[98],"[1]":[99],"Kaufmann":[102],"[6]":[103],"stationary":[105],"logic.":[106],"However,":[107],"more":[109],"general":[110],"than":[112],"just":[113],"anlaogue":[115],"there.":[120],"Conditions":[121],"are":[122,125],"sufficient":[126],"T":[130],"models":[133],"sentences":[135],"such":[136,155],"aas1aas2":[138],"\u2026":[139,141],"aasn\u22c1\u03a3(s1,":[140],"sn),":[142],"\u2200xaas":[143],"\u2228":[144],"\u03a3(x,":[145],"s),":[146],"so":[148],"forth.":[149],"Bruce":[150],"[2]":[151],"had":[152],"asked":[153],"whether":[154],"can":[158],"\u201caa\u201d":[164],"replaced":[165],"by":[166],"\u201cQ*\u201d,":[167],"Q*":[169],"\u00acQ\u00ac":[171],"(\u201cfor":[172],"all":[173],"but":[174],"countably":[175],"many\u201d).":[176]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}