k泛型有限图

Logic and Random Structures Pub Date : 1996-04-15 DOI:10.1090/dimacs/033/05

Eric Rosen, S. Shelah, S. Weinstein

{"title":"k泛型有限图","authors":"Eric Rosen, S. Shelah, S. Weinstein","doi":"10.1090/dimacs/033/05","DOIUrl":null,"url":null,"abstract":"This paper investigates the class of k universal nite graphs a local analog of the class of universal graphs which arises naturally in the study of nite variable logics The main results of the paper which are due to Shelah establish that the class of k universal graphs is not de nable by an in nite disjunction of rst order existential sentences with a nite number of variables and that there exist k universal graphs with no k extendible induced subgraphs","PeriodicalId":363831,"journal":{"name":"Logic and Random Structures","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"K-universal Finite Graphs\",\"authors\":\"Eric Rosen, S. Shelah, S. Weinstein\",\"doi\":\"10.1090/dimacs/033/05\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates the class of k universal nite graphs a local analog of the class of universal graphs which arises naturally in the study of nite variable logics The main results of the paper which are due to Shelah establish that the class of k universal graphs is not de nable by an in nite disjunction of rst order existential sentences with a nite number of variables and that there exist k universal graphs with no k extendible induced subgraphs\",\"PeriodicalId\":363831,\"journal\":{\"name\":\"Logic and Random Structures\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logic and Random Structures\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/dimacs/033/05\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic and Random Structures","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/dimacs/033/05","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

探讨类k普遍夜间图形本地模拟的通用图形类的出现自然夜间变量逻辑研究的论文的主要结果是由于沙拉建立类k的通用图形不是德·纳夫莱在夜间脱节的rst秩序存在的句子与夜间的变量和数量存在k通用图没有k可伸长的诱导子图

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

K-universal Finite Graphs

This paper investigates the class of k universal nite graphs a local analog of the class of universal graphs which arises naturally in the study of nite variable logics The main results of the paper which are due to Shelah establish that the class of k universal graphs is not de nable by an in nite disjunction of rst order existential sentences with a nite number of variables and that there exist k universal graphs with no k extendible induced subgraphs

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Logic and Random Structures

自引率

0.00%

发文量