Algebraic and logical methods in automated theorem proving and in the study of concurrency

particularly abundant nowadays; in fact logic is often called
"the calculus of computer science". On the other hand, the
development of computer science has a strong impact on the
research in algebra and logic, and in particular on the research
in computational mathematics and automated theorem proving.

In this talk I will present two, strongly interrelated, directions
of my recent research, which reflect some of the links between
algebra, logic and computer science emphasized above:

1. Decompositions of algebraic structures in terms of simpler
structures, and applications to automated theorem proving.

2. A study of interaction in complex systems, and applications
to modular checking of certain properties of systems obtained
by composing simpler systems.