Abstract
In these days one of the main themes of research in theoretical computer science is quantum computing. In that context, the quantum satisfiability problem (QSAT) shows important elements of the quantum computational complexity, which are related to the probabilistic satisfiability problem (PSAT). The general aim of the present project is to investigate the logical aspects of QSAT, contras…