{"title":"Kahr-Moore-Wang类包含不可测试的属性","authors":"Charles Jordan, T. Zeugmann","doi":"10.22364/BJMC.2016.4.4.11","DOIUrl":null,"url":null,"abstract":". Property testing is a kind of randomized approximation in which one takes a small, random sample of a structure and wishes to determine whether the structure satisfies some property or is far from satisfying the property. We focus on the testability of classes of first-order expressible properties, and in particular, on the clas-sification of prefix-vocabulary classes for testability. The main result is the untestability of [ ∀∃∀ , (0 , 1)] = . We also show that this class remains untestable without equality in at least one model of testing. These classes are well-known and (at least one is) minimal for untestability. We discuss what is currently known about the classification for testability and briefly compare it to other classifications.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"138 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Kahr-Moore-Wang Class Contains Untestable Properties\",\"authors\":\"Charles Jordan, T. Zeugmann\",\"doi\":\"10.22364/BJMC.2016.4.4.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". Property testing is a kind of randomized approximation in which one takes a small, random sample of a structure and wishes to determine whether the structure satisfies some property or is far from satisfying the property. We focus on the testability of classes of first-order expressible properties, and in particular, on the clas-sification of prefix-vocabulary classes for testability. The main result is the untestability of [ ∀∃∀ , (0 , 1)] = . We also show that this class remains untestable without equality in at least one model of testing. These classes are well-known and (at least one is) minimal for untestability. We discuss what is currently known about the classification for testability and briefly compare it to other classifications.\",\"PeriodicalId\":431209,\"journal\":{\"name\":\"Balt. J. Mod. Comput.\",\"volume\":\"138 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Balt. J. Mod. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22364/BJMC.2016.4.4.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Balt. J. Mod. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22364/BJMC.2016.4.4.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Kahr-Moore-Wang Class Contains Untestable Properties
. Property testing is a kind of randomized approximation in which one takes a small, random sample of a structure and wishes to determine whether the structure satisfies some property or is far from satisfying the property. We focus on the testability of classes of first-order expressible properties, and in particular, on the clas-sification of prefix-vocabulary classes for testability. The main result is the untestability of [ ∀∃∀ , (0 , 1)] = . We also show that this class remains untestable without equality in at least one model of testing. These classes are well-known and (at least one is) minimal for untestability. We discuss what is currently known about the classification for testability and briefly compare it to other classifications.