Theory discovery from data with mixed quantifiers

Journal of Philosophical Logic 19 (1):1 - 33 (1990)
Abstract
Convergent realists desire scientific methods that converge reliably to informative, true theories over a wide range of theoretical possibilities. Much attention has been paid to the problem of induction from quantifier-free data. In this paper, we employ the techniques of formal learning theory and model theory to explore the reliable inference of theories from data containing alternating quantifiers. We obtain a hierarchy of inductive problems depending on the quantifier prefix complexity of the formulas that constitute the data, and we provide bounds relating the quantifier prefix complexity of the data to the quantifier prefix complexity of the theories that can be reliably inferred from such data without background knowledge. We also examine the question whether there are theories with mixed quantifiers that can be reliably inferred with closed, universal formulas in the data, but not without
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00211184
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,520
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
On the Danger of Half-Truths.Daniel Osherson & Scott Weinstein - 1995 - Journal of Philosophical Logic 24 (1):85 - 115.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
11 ( #409,372 of 2,180,764 )

Recent downloads (6 months)
1 ( #300,627 of 2,180,764 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums