Skip to main content

Four Approaches to Automated Reasoning with Differential Algebraic Structures

  • Conference paper
Artificial Intelligence and Symbolic Computation (AISC 2004)

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

Abstract

While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation of algebraic structures, partial functions in a logic of total functions, or the level of abstraction in formal proofs. Different approaches aiming at solving these problems will be evaluated and classified according to features such as the degree of mechanization obtained or the direct correspondence to the mathematical proofs. From this study, an environment for further developments in Homological Algebra will be proposed.

Partially supported by MCyT, project TIC2002-01626 and by CAR ACPI-2002/06.

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

Access this chapter

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. Ballarin, C.: Locales and Locale Expressions in Isabelle/Isar. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 34–50. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Berghofer, S.: Program Extraction in Simply-Typed Higher Order Logic. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, pp. 21–38. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Brown, R.: The twisted Eilenberg-Zilber theorem, Celebrazioni Arch. Secolo XX, Simp. Top, pp. 34-37 (1967)

    Google Scholar 

  4. Calmet, J.: Some Grand Mathematical Challenges in Mechanized Mathematics. In: Hardin, T., Rioboo, R. (eds.) Calculemus 2003, pp. 137–141 (2003)

    Google Scholar 

  5. Dousson, X., Sergeraert, F., Siret, Y.: The Kenzo program, http://www-fourier.ujf-grenoble.fr/~sergerar/Kenzo/

  6. Glimming, J.: Logic and Automation for Algebra of Programming, Master Thesis, Maths Institute, University of Oxford (August 2001), available at http://www.nada.kth.se/~glimming/publications.shtml

  7. Gugenheim, V.K.A.M.: On the chain complex of a fibration. Illinois Journal of Mathematics 16, 398–414 (1972)

    MATH  MathSciNet  Google Scholar 

  8. Kobayashi, H., Suzuki, H., Murao, H.: Rings and Modules in Isabelle/HOL. In: Hardin, T., Rioboo, R. (eds.) Calculemus 2003, pp. 124–129 (2003)

    Google Scholar 

  9. Lambán, L., Pascual, V., Rubio, J.: An object-oriented interpretation of the EAT system. Appl. Algebra Eng. Commun. Comput. 14(3), 187–215

    Google Scholar 

  10. Mac Lane, S.: Homology. Springer, Heidelberg (1994)

    Google Scholar 

  11. Naraschewski, W., Wenzel, M.: Object-Oriented Verification based on Record Subtyping in Higher-Order Logic. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol. 1479, pp. 349–366. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  13. Paulson, L.: Defining Functions on Equivalence Classes, Report, available at http://www.cl.cam.ac.uk/users/lcp/papers/Reports/equivclasses.pdf

  14. Rubio, J., Sergeraert, F.: Constructive Algebraic Topology. Lecture Notes Summer School in Fundamental Algebraic Topology, Institut Fourier (1997)

    Google Scholar 

  15. Rubio, J., Sergeraert, F., Siret, Y.: EAT: Symbolic Software for Effective Homology Computation, Institut Fourier, Grenoble (1997)

    Google Scholar 

  16. Shih, W.: Homologie des espaces fibrés, Publications Math.ématiques de l’I.H.E.S. 13 (1962)

    Google Scholar 

  17. Théry, L.: Proving and computing: A certified version of the Buchberger’s algorithm. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, p. 349. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aransay, J., Ballarin, C., Rubio, J. (2004). Four Approaches to Automated Reasoning with Differential Algebraic Structures. In: Buchberger, B., Campbell, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 2004. Lecture Notes in Computer Science(), vol 3249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30210-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30210-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30210-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics