Journal of symbolic computation

• 

  Año 2003, Vol. 35, Número 2

  • Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

    Randal E. Bryant, Miroslav N. Velev

    págs. 73-106

    

  • Computing left Kan extensions

    M. Leeming, M. R. Bush, R.F.C. Walters

    págs. 107-126

    

  • A database of categories

    Ryan Gunther, Michael Fleming, Robert Rosebrugh

    págs. 127-135

    

  • Implementing finite structures in Mathematica via a skeletal topos of finite sets

    Susan B. Niefield

    págs. 137-151

    

  • The term orderings which are compatible with composition II

    Jinwang Liu, Mingsheng Wang, Zhuojun Liu

    págs. 153-168

    

  • A result on braids via the investigation of a rewriting system

    Serge Burckel

    págs. 169-175

    

  • On the Gröbner bases of some symmetric systems and their application to coding theory

    Massimiliano Sala, Teo Mora

    págs. 177-194

    

  • Constructive recognition of classical groups in their natural representation

    Peter A. Brooksbank

    págs. 195-239