Abstract
In this paper we are concerned with some general properties of scientific hypotheses. We investigate the relationship between the situation when the task is to verify a given hypothesis, and when a scientist has to pick a correct hypothesis from an arbitrary class of alternatives. Both these procedures are based on induction. We understand hypotheses as generalized quantifiers of types \(\left\langle 1\right\rangle\) or \(\left\langle 1,1\right\rangle\). Some of their formal features, like monotonicity, appear to be of great relevance. We first focus on monotonicity, extendability and persistence of quantifiers. They are investigated in context of epistemological verifiability of scientific hypotheses. In the second part we show that some of these properties imply learnability. As a result two strong paradigms are joined: the paradigm of computational epistemology (see e.g.[6,5] ), which goes back to the notion of identification in the limit as formulated in [4], and the paradigm of investigating natural language determiners in terms of generalized quantifiers in finite models (see e.g.[1]).
Chapter PDF
Similar content being viewed by others
Keywords
References
van Benthem, J.: Essays in Logical Semantics. D. Reidel, Dordrecht (1986)
Feyerabend, P.: Against Method. Verso Press, London (1975)
Gierasimczuk, N.: The Problem of Learning the Semantics of Quantifiers. In: ten Cate, B.D., Zeevat, H.W. (eds.) TbiLLC 2005. LNCS, vol. 4363, pp. 117–126. Springer, Heidelberg (2007)
Gold, E.M.: Language Identification in the Limit. Information and Control 10, 447–474 (1967)
Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems that Learn. MIT Press, Chicago (1999)
Kelly, K.: The Logic of Reliable Inquiry. Oxford University Press, Oxford (1996)
Martin, E., Osherson, D.: Elements of Scientific Inquiry. Cambridge (1998)
Osherson, D., de Jongh, D., Martin, E., Weinstein, S.: Formal Learning Theory. In: van Benthem, J., Ter Meulen, A. (eds.) Handbook of Logic and Language. MIT Press, Cambridge (1997)
Tiede, H.-J.: Identifiability in the Limit of Context-Free Generalized Quantifiers. Journal of Language and Computation 1, 93–102 (1999)
Väänänen, J.: On the Expressive Power of Monotone Natural Language Quantifiers over Finite Models. Journal of Philosophical Logic 31, 327–358 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gierasimczuk, N. (2009). Identification through Inductive Verification. In: Bosch, P., Gabelaia, D., Lang, J. (eds) Logic, Language, and Computation. TbiLLC 2007. Lecture Notes in Computer Science(), vol 5422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00665-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-00665-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00664-7
Online ISBN: 978-3-642-00665-4
eBook Packages: Computer ScienceComputer Science (R0)