A note on computational complexity of a statistical deducibility testing procedure

  • Ivan Kramosil
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Space Complexity Decision Procedure Theorem Prove Proof Theory Automate Theorem Prove 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ch. L. Chang, R. C. T. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, London, 1973.Google Scholar
  2. 2.
    I. Kramosil: Statistical Approach to Proof Theory. Appendix to Kybemetika (Prague), vol. 15, 1979.Google Scholar
  3. 3.
    I. Kramosil, J. Šindelář: Statistical Deducibility Testing with Stochastic Parameters. Kybemetika 14 (1978), 6, 385–396.Google Scholar
  4. 4.
    M. O. Rabin: Theoretical Impediments to Artificial Intelligence. In: Information Processing 1974, North Holland Publ. Comp., Amsterdam, 1974, pp. 615–619.Google Scholar
  5. 5.
    A. Rényi: Probability Theory. Akadémiai Kiadó, Bu dapest, 1970.Google Scholar
  6. 6.
    A. Špaček: Statistical Estimation of Provability in Boolean Logics. In: Transactions of the Second Prague Conference on Information Theory,..., Prague, 1959, NČSAV (Publishing House of the Czech. Acad. of Sci.), 1960, pp. 609–626.Google Scholar
  7. 7.
    O. Štěpánková, I. M. Havel: A Logical Theory of Robot Problem Solving. Artificial Intelligence 7 (1976), pp. 129–161.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Ivan Kramosil
    • 1
  1. 1.Institute of Information Theory and AutomationCzechoslovak Academy of SciencesPragueCzechoslovakia

Personalised recommendations