Spectral synthesis for Banach Algebras II

This paper continues the study of spectral synthesis and the topologies tau-infinity and tau-r on the ideal space of a Banach algebra, concentrating particularly on the class of Haagerup tensor products of C*-algebras. For this class, it is shown that spectral synthesis is equivalent to the Hausdorffness of tau_infinity. Under a weak extra condition, spectral synthesis is shown to be equivalent to the Hausdorffness of tau_r.

Inductive Theorem Proving and Computer Algebra in the Mathweb Software Bus

Reasoning systems have reached a high degree of maturity in the last decade. However, even the most successful systems are usually not general purpose problem solvers but are typically specialised on problems in a certain domain. The MathWeb SOftware Bus (Mathweb-SB) is a system for combining reasoning specialists via a common osftware bus. We described the integration of the lambda-clam systems, a reasoning specialist for proofs by induction, into the MathWeb-SB. Due to this integration, lambda-clam now offers its theorem proving expertise to other systems in the MathWeb-SB. On the other hand, lambda-clam can use the services of any reasoning specialist already integrated. We focus on the latter and describe first experimnents on proving theorems by induction using the computational power of the MAPLE system within lambda-clam.