Skip to main content
SpringerLink
Log in

Polynomially complete problems in the logic of automate discovery

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cook, S.A., The Complexity of Theorem-proving Procedures, Proc. Third Annual ACM Symposium on Theory of Computing, May, 1971, p. 151–158.

    Google Scholar 

  2. Hájek, P., On Logics of Discovery, this volume pp. 30–45.

    Google Scholar 

  3. Hájek, P., Automatic Listing of Important Observational Statements I, II, III, Kybernetika 9 (1973), 187–205, 251–270 and 10(1974), 95–124.

    Google Scholar 

  4. Hájek, P., Havel, I. and Chytil, M., The GUHA Method of Automated Hypotheses Determination, Computing 1 (1966), 293–308.

    Google Scholar 

  5. Hájek, P. and Havránek, T., A Logic of Automated Discovery, book in preparation.

    Google Scholar 

  6. Karp, R. M., Reducibility among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, NY 1972, 85–104.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Prague

    Pavel Pudlák

Authors
  1. Pavel Pudlák
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pudlák, P. (1975). Polynomially complete problems in the logic of automate discovery. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_221

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_221

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation