Skip to main content
SpringerLink
Log in

Towards a theory of recursive structures

Extended abstract

  • Conference paper
  • First Online:
Book cover Logical Foundations of Computer Science (LFCS 1997)

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

Included in the following conference series:

  • 111 Accesses

Abstract

In computer science, one is interested mainly in finite objects. Insofar as infinite objects are of interest, they must be computable, i.e., recursive, thus admitting an effective finite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure, model or data base. We summarize our recent work on recursive structures and data bases, including (i) high undecidability of specific problems, (ii) connections between the descriptive complexity of finitary problems and the computational complexity of their infinitary analogues, (iii) completeness for query languages, (iv) descriptive and computational complexity, and (v) zero-one laws.

A full, but older, version of this paper appeared as an invited paper in STACS '94, Proc. 11th Ann. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 775, Springer-Verlag, Berlin, 1994, pp. 633–645.

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. R. Aharoni, M. Magidor and R. A. Shore, “On the Strength of König's Duality Theorem”, J. of Combinatorial Theory (Series B) 54:2 (1992), 257–290.

    Google Scholar 

  2. D.R. Bean, “Effective Coloration”, J. Sym. Logic 41 (1976), 469–480.

    Google Scholar 

  3. D.R. Bean, “Recursive Euler and Hamiltonian Paths”, Proc. Amer. Math. Soc. 55 (1976), 385–394.

    Google Scholar 

  4. R. Beigel and W. I. Gasarch, unpublished results, 1986–1990.

    Google Scholar 

  5. R. Beigel and W. I. Gasarch, “On the Complexity of Finding the Chromatic Number of a Recursive Graph”, Parts I & II, Ann. Pure and Appl. Logic 45 (1989), 1–38, 227–247.

    Google Scholar 

  6. S. A. Burr, “Some Undecidable Problems Involving the Edge-Coloring and Vertex Coloring of Graphs”, Disc. Math. 50 (1984), 171–177.

    Google Scholar 

  7. A. K. Chandra and D. Harel, “Computable Queries for Relational Data Bases”, J. Comp. Syst. Sci. 21, (1980), 156–178.

    Google Scholar 

  8. R. Fagin, “Generalized First-Order Spectra and Polynomial-Time Recognizable Sets”, In Complexity of Computations (R. Karp, ed.), SIAM-AMS Proceedings, Vol. 7, 1974, pp. 43–73.

    Google Scholar 

  9. R. Fagin, “Probabilities on Finite Models”, J. of Symbolic Logic, 41, (1976), 50–58.

    Google Scholar 

  10. W. I. Gasarch and M. Lockwood, “The Existence of Matchings for Recursive and Highly Recursive Bipartite Graphs”, Technical Report 2029, Univ. of Maryland, May 1988.

    Google Scholar 

  11. D. Harel, “Hamiltonian Paths in Infinite Graphs”, Israel J. Math. 76:3 (1991), 317–336. (Also, Proc. 23rd Ann. ACM Symp. on Theory of Computing, New Orleans, pp. 220–229, 1991).

    Google Scholar 

  12. T. Hirst and D. Harel, “Taking it to the Limit: On Infinite Variants of NP-Complete Problems”, J. Comput. Syst. Sci., to appear. (Also, Proc. 8th IEEE Conf. on Structure in Complexity Theory, IEEE Press, New York, 1993, pp. 292–304).

    Google Scholar 

  13. T. Hirst and D. Harel, “Completeness Results for Recursive Data Bases”, J. Comput. Syst. Sci., to appear. (Also, 12th ACM Ann. Symp. on Principles of Database Systems, ACM Press, New York, 1993, 244–252).

    Google Scholar 

  14. T. Hirst and D. Harel, “More about Recursive Structures: Descriptive Complexity and Zero-One Laws”, Proc. 11th Symp. on Logic in Computer Science, New Brunswick, NJ, July, 1996.

    Google Scholar 

  15. A. Manaster and J. Rosenstein, “Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)”, Proc. London Math. Soc. 3 (1972), 615–654.

    Google Scholar 

  16. A. Nerode and J. Remmel, “A Survey of Lattices of R. E. Substructures”, In Recursion Theory, Proc. Symp. in Pure Math. Vol. 42 (A. Nerode and R. A. Shore, eds.), Amer. Math. Soc., Providence, R. L., 1985, pp. 323–375.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel

    David Harel

Authors
  1. David Harel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sergei Adian Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harel, D. (1997). Towards a theory of recursive structures. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-63045-7_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63045-6

  • Online ISBN: 978-3-540-69065-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation