The Kahr-Moore-Wang Class Contains Untestable Properties

Jordan, Charles; Zeugmann, Thomas

Baltic journal of modern computing, 2016, 4(4), 736-752

Permalink : https://hdl.handle.net/2115/64554

このアイテムのアクセス数:542件（2026-08-09 23:32 集計）

ファイル	フォーマット	サイズ	閲覧回数	説明
4_4_11_Jordan	pdf	433 KB	557

アクセス権	open access
URI	https://hdl.handle.net/2115/64554
タイトル	The Kahr-Moore-Wang Class Contains Untestable Properties
著者	著者名 Jordan, Charles
著者	著者名 Zeugmann, Thomas
言語	英語
キーワード	property testing
	logic
	randomized algorithms
	Kahr-Moore-Wang class
発行日	2016
出版者	University of Latvia
収録物名	Baltic journal of modern computing
巻(号)	4(4)
ページ	736-752
抄録	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 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.
資源タイプ	学術雑誌論文
出版タイプ	Version of Record
権利情報	Creative Commons Attribution-ShareAlike 4.0 International
PISSN	2255-8942
関連情報 (isIdenticalTo)	出版社版DOI https://doi.org/10.22364/bjmc.2016.4.4.11