The Kahr-Moore-Wang Class Contains Untestable Properties

Jordan, Charles; Zeugmann, Thomas

doi:10.22364/bjmc.2016.4.4.11


Hokkaido University \| Library \| HUSCAP	Advanced Search		言語

	Home
	About HUSCAP
	Open Access Policy

	Browse by Author

Browse
	Communities & Collections

	Scholarly Journals
	Theses
	Doctoral Dissertations Listed by Graduate Schools
	Conference Procs.
	Events

	HUSCAP Senior (in Japanese)

	Societies

	Downloads (country)

For university staff
	How to post your papers to HUSCAP
	Publication of theses
	Helpline about theses publication

Open Archives Compliant

You can search our collection also at:
	Google
	Google Scholar
	CiNii
	IRDB
	OAIster
	NDLTD

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

The Kahr-Moore-Wang Class Contains Untestable Properties

This item is licensed under:Creative Commons Attribution-ShareAlike 4.0 International

Files in This Item:

4_4_11_Jordan.pdf

433.82 kB

PDF

View/Open

Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/64554

Title:	The Kahr-Moore-Wang Class Contains Untestable Properties
Authors:	Jordan, Charles Browse this author
Authors:	Zeugmann, Thomas Browse this author
Keywords:	property testing
	logic
	randomized algorithms
	Kahr-Moore-Wang class
Issue Date:	2016
Publisher:	University of Latvia
Journal Title:	Baltic journal of modern computing
Volume:	4
Issue:	4
Start Page:	736
End Page:	752
Publisher DOI:	10.22364/bjmc.2016.4.4.11
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 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.
Rights:	https://creativecommons.org/licenses/by-sa/4.0/
Type:	article
URI:	http://hdl.handle.net/2115/64554
Appears in Collections:	情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: Zeugmann Thomas

OAI-PMH ( junii2 , jpcoar_1.0 )

- Hokkaido University