Abstract
Deduction, induction, learning, are various aspects of a more general scientific activity: the discovery of truth. We propose to embed them in a common, logical framework. First,we define a generalized notion of “logical consequence.” lternating compact and “weakly compact” onsequences,we stratify the set of generalized logical consequences of a given theory in a hierarchy. Classical first-order logic is a particular case of this framework; the fact that it is all about deduction is due to the compactness theorem,and this is reflected by the collapsing of the corresponding hierarchy to the first level. Classical learning paradigms in the inductive inference literature provide other particular cases. Finite learning corresponds exactly to the first level (or level σ1 ) of the hierarchy,whereas learning in the limit corresponds to another level (namely σ2). More generally,strong and natural connections exist between our hierarchy of generalized logical consequences,the Borel hierarchy, and the hierarchy which measures the complexity of a formula in terms of alternations of quantifiers. It is hoped that this framework provides the foundation of a unified logic of deduction and induction,and highlights the inductive nature of learning. An essential motivation for our work is to apply the theory presented here to the design of “Inductive Prolog ”, a system with both deductive and inductive capabilities,based on a natural extension of the resolution principle.
Eric Martin is supported by the Australian Research Council Grant A49803051. Frank Stephan is supported by the Deutsche Forschungsgemeinschaft (DFG)Heisenberg Grant Ste 967/1-1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Angluin.Inductive Inference of ormal Languages from Positive Data.Information and Control, 45, 1980, p.117–135.
J. Barwise.Admissible Sets and Structures.Perspectives in Mathematical Logic, Springer-Verlag,1975.
K. Doets. From Logic to Logic Programming. MIT Press,1994.
W. Gasarch, M. Pleszkoch, F. Stephan,and M. Velauthapillai.Classification using information. Annals of Mathematics and Artificial Intelligence. Selected papers from ALT 1994 and AII 1994,23:147–168,1998.
M.L. Ginsberg ed.Readings in Nonmonotonic reasoning. Morgan Kaufmann,1987.
L. Henkin.Completeness in the theoryof types.Journal of Symbolic Logic 15:81–91,1950.
S. Jain, D.N. Osherson. J.S. Roye and A. Sharma.Systems that learn: An Introduction to Learning Theory,Second Edition. The MIT Press,1999.
K. Kelly.The Logic of Reliable Inquiry. Oxford University Press,1996.
K. Kelly and C. Glymour.Inductive inference and theory-laden data.Journal of Philosophical Logic,21(4),1992.
H.J. Keisler. Fundamentals of Model Theory. In Handbook of Mathematical Logic, Ed.J. Barwise,Springer-Verlag,1977.
J.W. Lloyd.Foundations of Logic Programming,2nd edition. Springer-Verlag, 1987.
M. Makkai.Admissible Sets and Infinitary Logic. In Handbook of Mathematical Logic,Ed.J. Barwise,Springer-Verlag,1977.
E. Martin and D.N. Osherson.Elements of Scientific Inquiry. The MIT Press, 1998.
S.H. Nienhuys-Cheng and R. de Wolf.Foundations of Inductive Logic Programming.Lecture Notes in Artificial Intelligence,Vol.1228,Springer-Verlag,1997.
K. Popper.The Logic of Scientific Discovery.Hutchinson, London,1959.
R. Reiter.On closed world data bases. In Logic and Data Bases,Ed.A. Gallaire and J. Minker.Plenum, New York,1978.
J. Shoenfield.Mathematical Logic. Addison-Wesley,1967.
S.M. Srivastava.A Course on Borel Sets. Graduate Texts in Mathematics 180. Springer-Verlag,1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, E., Sharma, A., Stephan, F. (2001). A General Theory of Deduction,Induction,and Learning. In: Jantke, K.P., Shinohara, A. (eds) Discovery Science. DS 2001. Lecture Notes in Computer Science(), vol 2226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45650-3_21
Download citation
DOI: https://doi.org/10.1007/3-540-45650-3_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42956-2
Online ISBN: 978-3-540-45650-6
eBook Packages: Springer Book Archive