2024-03-29T09:37:56Zhttps://eprints.lib.hokudai.ac.jp/dspace-oai/requestoai:eprints.lib.hokudai.ac.jp:2115/645542022-11-17T02:08:08Zhdl_2115_20053hdl_2115_145The Kahr-Moore-Wang Class Contains Untestable PropertiesJordan, CharlesZeugmann, Thomasopen accessCreative Commons Attribution-ShareAlike 4.0 Internationalproperty testinglogicrandomized algorithmsKahr-Moore-Wang class007Property 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 classification of prefix-vocabulary classes for testability. The main result is the untestability of [for all there exists for all, (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.University of Latvia2016engjournal articleVoRhttp://hdl.handle.net/2115/64554https://doi.org/10.22364/bjmc.2016.4.4.112255-8942Baltic journal of modern computing44736752https://eprints.lib.hokudai.ac.jp/dspace/bitstream/2115/64554/1/4_4_11_Jordan.pdfapplication/pdf433.82 KB2016