Journal of symbolic computation

• 

  Año 2006, Vol. 41, Número 3

  • Bruno Buchberger ¿ A life devoted to symbolic computation

    Hoon Hong, F. Winkler, D. Kapur, Peter Paule

    págs. 255-258

    

  • Preface on the contributed papers

    D. Kapur

    págs. 259-260

    

  • On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals

    Ulrich Oberst, F. Pauer, Werner Heiß

    • Resumen

    págs. 261-284

    

  • Comprehensive Gröbner bases and regular rings

    Volker Weispfenning

    • Resumen

    págs. 285-296

    

  • Tree polynomials and non-associative Gröbner bases

    Lothar Gerritzen

    • Resumen

    págs. 297-316

    

  • Gröbner bases and logarithmic -modules

    José María Ucha Enríquez, Francisco Jesús Castro Jiménez

    • Resumen

    págs. 317-335

    

  • Lexicographic Gröbner bases for transportation problems of format

    Giandomenico Boffi, Fabio Rossi

    • Resumen

    págs. 336-356

    

  • Gröbner¿Shirshov bases for some braid groups

    Andrei Vesnin, Leonid Bokut

    • Resumen

    págs. 357-371

    

  • Computing restrictions of ideals in finitely generated -algebras by means of Buchberger¿s algorithm

    Jörn Müller-Quade, Rainer Steinwandt, Thomas Beth

    • Resumen

    págs. 372-380

    

  • Towards a clausal analysis of cut-elimination

    Alexander Leitsch, Matthias Baaz

    • Resumen

    págs. 381-410

    

  • Logicographic symbols

    Koji Nakagawa

    • Resumen

    págs. 411-434

    

  • An automated prover for Zermelo¿Fraenkel set theory in Theorema

    Wolfgang Windsteiger

    • Resumen

    págs. 435-470

    

  • Comments on the translation of my PhD thesis

    Bruno Buchberger

    págs. 471-474

    

  • Bruno Buchberger¿s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal

    Bruno Buchberger

    • Resumen

    págs. 475-511