Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 2001: Fundamentals of Computation Theory pp 1–13Cite as

Towards Axiomatic Basis of Inductive Inference

  • Conference paper
  • First Online:

  • 437 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2138))

Abstract

The language for the formulation of the interesting statements is, of course, most important. We use first order predicate logic. Our main achievement in this paper is an axiom system which we believe to be more powerful than any other natural general purpose discovery axiom system.

We prove soundness of this axiom system in this paper. Additionally we prove that if we remove some of the requirements used in our axiom system, the system becomes not sound. We characterize the complexity of the quantifier prefix which guaranties provability of a true formula via our system. We prove also that if a true formula contains only monadic predicates, our axiom system is capable to prove this formula in the considered model.

This project was supported by an International Agreement under NSF Grant 9421640.

Research supported by Grant No.01.0354 from the Latvian Council of Science, Contract IST-1999-11234 (QAIP) from the European Commission, and the Swedish Institute, Project ML-2000

Supported in part by NSF Grant CCR-9732692

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jānis Bārzdiņš, Rūsiņš Freivalds and Carl H. Smith. Learning with confidence. ”Lecture Notes in Computer Science”, Springer, 1996, v.1046, p.207–218.

    Google Scholar 

  2. Jānis Bārzdiņš, Rūsiņš Freivalds and Carl H. Smith. Learning formulae from elementary facts. ”Lecture Notes in Computer Science”, Springer, 1997, v.1208, p.272–285.

    Google Scholar 

  3. Jānis Bārzdiņš, Rūsiņš Freivalds and Carl H. Smith. A Logic of Discovery. ”Lecture Notes in Artificial Intelligence”, Springer, 1998, v.1532, p.401–402.

    Google Scholar 

  4. Rūsiņš Freivalds. Inductive inference of recursive functions: Qualitative theory. Lecture Notes in Computer Science, 1991, v. 502, p. 77–110.

    Google Scholar 

  5. E. Mark Gold. Language identification in the limit. Information and Control, 1967, v. 10, p. 447–474.

    Article  MATH  Google Scholar 

  6. David Hilbert. Grundlagen der Geometrie (Festschrift zur Feier der Enthüllung des Gauss-Weber-Denkmals in Göttingen), Leipzig, Teubner, 1879.

    Google Scholar 

  7. Stephen Cole Kleene. Introduction to Metamathematics. North-Holland, 1952.

    Google Scholar 

  8. Daniel N. Osherson, Michael Stob, and Scott Weinstein. A universal inductive inference machine. Journal of Symbolic Logic, 1991, v. 56, No. 2, p.661–672.

    Article  MATH  MathSciNet  Google Scholar 

  9. Giuseppe Peano. Selected works of Giuseppe Peano, with a biographical sketch and bibliography by H. C. Kennedy, London, 1973.

    Google Scholar 

  10. Ernst Zermelo. Über Grenzzahlen und Mengenbereiche. Fundamenta Mathematicae, 1930, v. 16, S. 29–47.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulv. 29, Riga, Latvia

    Jānis Bārzdiņš & Rūsiņš Freivalds

  2. Department of Computer Science, University of Maryland, USA

    Carl H. Smith

Authors
  1. Jānis Bārzdiņš
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rūsiņš Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carl H. Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Latvia, Raiņa bulvaris 29, LV-1459, Riga, Latvia

    Rūsiņš Freivalds

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bārzdiņš, J., Freivalds, R., Smith, C.H. (2001). Towards Axiomatic Basis of Inductive Inference. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation