Abstract
Alternative models of idealized scientific inquiry are investigated and compared. Particular attention is devoted to paradigms in which a scientist is required to determine the truth of a given sentence in the structure giving rise to his data.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Bibliography
Angluin, D.: 1986, ‘Learning regular sets from queries and counterexamples’, Technical Report YALEU/DCS/TR-464, Department of Computer Science, Yale University, March 1986.
AngluinD. and SmithC.: 1983, ‘A survey of inductive inference: Theory and methods’, Computing Surveys 15: 237–269.
BlumL. and BlumM.: 1975, ‘Toward a mathematical theory of inductive inference’, Information & Control 28: 125–155.
BlumerA., EhrenfeuchtA., HausslerD., and WarmuthM.: 1986, ‘Classifying learnable geometrical concepts with the Vapnik-Chervonenkis dimension’, in Proceedings of the 18th Annual ACM STOC, pp. 273–282, Assoc. Comp. Mach., New York.
Gaifman, H., Osherson, D., and Weinstein, S. (in press), ‘A reason for theoretical terms’, Erkenntnis.
Glymour, C.: 1984 ‘Inductive inference in the limit’, Erkenntnis 21.
GoldE. M.: 1967, ‘Language identification in the limit’, Information & Control 10: 447–474.
Kearns, M., Li, M., Pitt, L., and Valiant, L.: 1987, ‘On the learnability of Boolean formulae’, in Proceedings of the 19th ACM Symposium on Theory of Computing, pp. 285–295, ACM.
Kelly, K. and Glymour, C.: 1987, ‘On convergence to the truth and nothing but the truth’, manuscript.
Osherson, D., Stob, M., and Weinstein, S.: 1986, Systems that Learn, MIT Press.
OshersonD., StobM., and WeinsteinS.: 1986a, ‘Aggregating inductive expertise’, Information & Control 70: 69–95.
OshersonD., StobM., and WeinsteinS.: (1988), ‘Synthesizing inductive expertise’, Information & Computation 77: 138–161.
Osherson, D., Stob, M. and Weinstein, S.: 1988a, ‘Testability and inductive improvement’, manuscript.
OshersonD. and WeinsteinS.: 1982, ‘Criteria of language learning’, Information & Control 52(2): 123–138.
OshersonD. and WeinsteinS.: 1986, ‘Identification in the limit of first order structures’, Journal of Philosophical Logic 15: 55–81.
Osherson, D. and Weinstein, S: (1988), ‘Identifiable collections of countable structures’, Philosophy of Science.
Osherson, D. and Weinstein, S.: 1989, ‘On advancing simple hypotheses’, Philosophy of Science.
Putnam, H.: 1964, ‘Probability and confirmation’, in Mathematics, Matter, and Method, Cambridge University Press.
Robinson, A.: 1977, Complete Theories, North-Holland.
Rogers, H.: 1967, Theory of Recursive Functions and Effective Computability, McGraw-Hill.
Shapiro, E.: 1981, ‘An algorithm that infers theories from facts’, Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI.
ValiantL.: 1984, ‘A theory of the learnable’, Comm. ACM 27(11): 1134–1147.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Osherson, D.N., Weinstein, S. Paradigms of truth detection. J Philos Logic 18, 1–42 (1989). https://doi.org/10.1007/BF00296173
Issue Date:
DOI: https://doi.org/10.1007/BF00296173