Skip to main content
SpringerLink
Log in

On the Computational Power of the Logic Programs

  • Chapter
Mathematical Logic

Abstract

The aim of the present paper is a comparative study of the computational power of the logic programs and search computability [1].

Research partially supported by the Ministry of Culture, Science and Education, Contract # 933, 1988

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. N. Moschovakis, Abstract first order computability I, Trans. Amer. Math. Soc., 138 (1969), pp. 427–464.

    MathSciNet  MATH  Google Scholar 

  2. R. Fraisse, Une notion de recursivite relative, in: “Infinistic methods”, Proceedings of the symposium of mathematics, Warsaw, 1959, Peroamon Press, (1961), pp. 323–328.

    Google Scholar 

  3. I. N. Soskov, Definability via enumerations, J. Symb., Logic (to appear).

    Google Scholar 

  4. Y. N. Moschovakis, Abstract computability and invariant definability, J. Symb. Logic, 34:4, (1969).

    MathSciNet  Google Scholar 

  5. M. C. Fitting. “Fundamentals of Generalized Recursion Theory”, North-Holland, Amsterdam, (1981).

    MATH  Google Scholar 

  6. D. Lacombe, Recursion theoretic structures for relational systems, in: “Logic Colloquium’69”, R. O. Gandy, C. M. E. Yates. eds., North-Holland, Amsterdam, (1971).

    Google Scholar 

  7. H. Rogers, Jr., “Theory of recursive functions and effective computability”, McGraw-Hill Book Company, (1967).

    MATH  Google Scholar 

  8. J. R. Shoenfield, “Mathematical Logic”. Addison-Wesley Pub. Comp., (1967).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Applied Logic at Sofia University, blvd. Anton Ivanov 5, Sofia, 1126, Bulgaria

    Ivan N. Soskov

Authors
  1. Ivan N. Soskov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sofia University, Sofia, Bulgaria

    Petio Petrov Petkov

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Plenum Press, New York

About this chapter

Cite this chapter

Soskov, I.N. (1990). On the Computational Power of the Logic Programs. In: Petkov, P.P. (eds) Mathematical Logic. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0609-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0609-2_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-7890-0

  • Online ISBN: 978-1-4613-0609-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation