Skip to main content
SpringerLink
Log in

Gandy’s Theorem for Abstract Structures without the Equality Test

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2850))

Abstract.

In this paper we present a study of definability properties of fixed points of effective operators over astract structures without the equality test. We prove that Gandy’s theorem holds for abstract structures without the equality test. This provides a useful tool for dealing with inductive definitions using Σ-formulas over continuous data types.

This research was partially supported by the Danish Natural Science Research Council, Grant no. 21-02-0474, RFFI-DFG Grant no. 01-01-04003 and Grant Scientific School-2112.2003.1.

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. Barwise, J.: Admissible sets and Structures. Springer, Berlin (1975)

    MATH  Google Scholar 

  2. Blass, A., Gurevich, Y.: Background, reserve and Gandy machines. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 1–17. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Blass, A., Gurevich, Y., Shelah, S.: Choiceless polynomial time. Annals of Pure and Applied Logic 100, 141–187 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Berlin (1996)

    Google Scholar 

  5. Brattka, V., Hertling, P.: Topological properties of real number representations. Theoretical Computer Science 284(2), 1–17 (2002)

    Article  MathSciNet  Google Scholar 

  6. Dahlhaus, E., Makowsky, J.A.: Query languages for hierarchic databases. Information and Computation 101, 1–32 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Davar, A., Gurevich, Y.: Fixed-point logics. BSL 8(1), 65–88 (2002)

    Google Scholar 

  8. Ebbinghaus, H., Flum, J.: Finite Model Theory. Springer, Berlin (1999)

    MATH  Google Scholar 

  9. Edalat, A., Escardo, M.: Integration in Real PCF. In: Proc. of 11th Annual IEEE Symposium on Logic in Computer Science, pp. 382–393 (1996)

    Google Scholar 

  10. Edalat, A., Lieutie, A.: Domain theory and differential calculus function of one variable. In: Proc. IEEE Conference on Logic in Computer Science (LICS), pp. 277–298 (2002)

    Google Scholar 

  11. Ershov, Y.L.: Definability and computability. Plenum, New-York (1996)

    Google Scholar 

  12. Friedman, H., Ko, K.: Computational complexity of real functions. Theoretical Computer Science 20, 323–352 (1992)

    MathSciNet  Google Scholar 

  13. Gandy, R.: Inductive definitions. In: Fenstad, J.E., Hinman, P.D. (eds.) Generalized Recursion Theory, pp. 265–300. North-Holland, Amsterdam (1974)

    Chapter  Google Scholar 

  14. Grzegorczyk, A.: On the definitions of computable real continuous function. Fundamenta Mathematik 44, 61–71 (1957)

    MATH  MathSciNet  Google Scholar 

  15. Hinman, P.G.: Recursion on abstract structure. In: Griffor, E.R. (ed.) Handbook of Computability Theory, pp. 317–359. Elsevier, Amsterdam (1999)

    Google Scholar 

  16. Immerman, N.: Descriptive Complexity. Springer, New-York (1999)

    MATH  Google Scholar 

  17. Kohlenbach, U.: Proof theory and computational analysis. Electronic Notes in Theoretical Computer Science 13 (1998)

    Google Scholar 

  18. Korovina, M.: Computational aspects of Σ-definability over the real numbers without the equality test. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 330–344. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  19. Korovina, M.: Fixed points on the reals numbers without the equality test. Electronic Notes in Theoretical Computer Science 66(1) (2002)

    Google Scholar 

  20. Korovina, M., Kudinov, O.: Characteristic properties of majorant-computability over the reals. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 188–204. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  21. Korovina, M., Kudinov, O.: Some properties of majorant-computability. In: Arslanov, M., Lempp, S. (eds.) Recursion Theory and Complexity, Proceedings of the Kazan 1997 Workshop, Berlin - New York, July 14-19. de Gruyter Series in Logic and its Applications, vol. 2, pp. 97–115 (1999)

    Google Scholar 

  22. Moschovakis, Y.N.: Abstract first order computability I, II. Transactions of the American Mathematical Society 138, 427–504 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  23. Moschovakis, Y.N.: Elementary Induction on Abstract Structures. Studies in Logic and the Foundations of Mathematics, vol. 77. North-Holland, Amsterdam (1974)

    MATH  Google Scholar 

  24. Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1988)

    Google Scholar 

  25. Tucker, J.V., Zucker, J.I.: Computable functions and semicomputable sets on many-sorted algebras. In: Maibaum, T.S.E., Abramsky, S., Gabbay, D.M. (eds.) Handbook of Logic in Computer Science, vol. 5, pp. 397–525. Oxford University Press, Oxford (2000)

    Google Scholar 

  26. Vardi, M.: The complexity of relational query languages. In: Proc. of the 14th ACM Symposium on the Theory of Computing, pp. 37–146 (1982)

    Google Scholar 

  27. Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000, Aarhus C, Denmark

    Margarita Korovina

  2. A.P. Ershov Institute of Informatics Systems, Lavrent’ev ave., 6, 630090, Novosibirsk, Russia

    Margarita Korovina

Authors
  1. Margarita Korovina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Rice University, 77251-1892, Houston, TX, U.S.A.

    Moshe Y. Vardi

  2. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korovina, M. (2003). Gandy’s Theorem for Abstract Structures without the Equality Test. In: Vardi, M.Y., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2003. Lecture Notes in Computer Science(), vol 2850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39813-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39813-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20101-4

  • Online ISBN: 978-3-540-39813-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation