Journal of symbolic computation

• 

  Año 2005, Vol. 39, Número 5

  • Integration of automated reasoning and computer algebra systems

    Volker Sorge, Olga Caprotti

    págs. 501-502

    

  • A reconstruction and extension of Maple¿s assume facility via constraint contextual rewriting

    Alessandro Armando, Clemens Ballarin

    • Resumen

    págs. 503-521

    

  • The meaning of infinity in calculus and computer algebra systems

    Michael Beeson, Freek Wiedijk

    • Resumen

    págs. 523-538

    

  • Hidden verification for computational mathematics

    Tom Kelsey, Ursula Martin, Hanne Gottliebsen

    • Resumen

    págs. 539-567

    

  • Dealing with algebraic expressions over a field in Coq using Maple

    David Delahaye, Micaela Mayero

    • Resumen

    págs. 569-592

    

  • Automated conjecture making in number theory using HR, Otter and Maple

    Simon Colton

    • Resumen

    págs. 593-615