Skip to main content
SpringerLink
Log in

Interactive theorem proving and computer algebra

  • Conference paper
  • First Online:
Integrating Symbolic Mathematical Computation and Artificial Intelligence (AISMC 1994)

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

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. L. M. Batten, A. Beutelspacher: The Theory of finite Linear Spaces. Combinatorics of Points and Lines, Cambridge University Press, Cambridge (1993).

    Google Scholar 

  2. T. Becker, V. Weispfenning: Groebner Bases, Springer Graduate Texts 141, Springer Verlag Berlin Heidelberg, New York (1993).

    Google Scholar 

  3. A. Beutelspacher, J. Ueberberg: Symbolic Incidence Geometry. Proposal for doing geometry with a computer, SIGSAM Bull. 27, No. 2 (1993), 19–29 and No. 3 (1993), 9–24.

    Google Scholar 

  4. B. Buchberger: Gröbner bases, in preparation.

    Google Scholar 

  5. G. E. Collins: Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition, Lecture Notes in Computer Science 33, Springer-Verlag, Berlin, Heidelberg, New York (1975) 134–183.

    Google Scholar 

  6. N. de Bruijn, P. Erdös: On a combinatorial problem, Indag. Math. 10 (1948), 421–423.

    Google Scholar 

  7. P. Dembowski: Semiaffine Ebenen Arch. Math. 13 (1962), 120–131.

    Article  Google Scholar 

  8. H. Melenk, H. M. Möller, W. Neun: Groebner — A package for calculating Groebner bases, part of the documentation for REDUCE 3.4.

    Google Scholar 

  9. R. Loos, V. Weispfenning: Applying linear quantifier elimination, to appear.

    Google Scholar 

  10. J. Shoenfield: Mathematical Logic, Addison Wesley, Massachusetts (1967).

    Google Scholar 

  11. J. Ueberberg: Einführung in die Computeralgebra mit REDUCE, Bibliographisches Institut Mannheim, Leipzig, Wien (1992).

    Google Scholar 

  12. J. Ueberberg: Symbolic Incidence Geometry and Finite Linear Spaces, Discrete Math. 129 (1994), 205–217.

    Article  Google Scholar 

  13. J. Ueberberg: Interactive Theorem Proving and Symbolic Incidence Geometry, in preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Arndtstrasse 2, D-35392, Giessen

    Johannes Ueberberg

Authors
  1. Johannes Ueberberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jacques Calmet John A. Campbell

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ueberberg, J. (1995). Interactive theorem proving and computer algebra. In: Calmet, J., Campbell, J.A. (eds) Integrating Symbolic Mathematical Computation and Artificial Intelligence. AISMC 1994. Lecture Notes in Computer Science, vol 958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60156-2_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-60156-2_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60156-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation