Roberto Giuntini

The main aim of the paper is to solve a problem posed in Di Nola et al. (Multiple Val. Logic 8:715–750, 2002) whether every pseudo BL-algebra with two negations is good, i.e. whether the two negations commute. This property is intimately connected with possessing a state, which in turn is essential in quantum logical applications. We approach the solution by describing the structure of pseudo BL-algebras and pseudo hoops as important families of quantum structures. We show when a pseudo hoop can be embedded into the negative cone of the reals. We give an equational base characterizing representable pseudo hoops. We also describe some subvarieties: normal-valued, and varieties where each maximal filter is normal. We produce some noncommutative covers and extend the area where each algebra is good. Finally, we show that there are uncountably many subvarieties of pseudo BL-algebras having members that are not good.

The characteristic holistic features of the quantum theoretic formalism and the intriguing notion of entanglement can be applied to a field that is far from microphysics: logical semantics. Quantum computational logics are new forms of quantum logic that have been suggested by the theory of quantum logical gates in quantum computation. In the standard semantics of these logics, sentences denote quantum information quantities: systems of qubits (quregisters) or, more generally, mixtures of quregisters (qumixes), while logical connectives are interpreted as special quantum logical gates (which have a characteristic reversible and dynamic behavior). In this framework, states of knowledge may be entangled, in such a way that our information about the whole determines our information about the parts; and the procedure cannot be, generally, inverted. In spite of its appealing properties, the standard version of the quantum computational semantics is strongly “Hilbert-space dependent”. This certainly represents a shortcoming for all applications, where real and complex numbers do not generally play any significant role (as happens, for instance, in the case of natural and of artistic languages). We propose an abstract version of quantum computational semantics, where abstract qumixes, quregisters and registers are identified with some special objects (not necessarily living in a Hilbert space), while gates are reversible functions that transform qumixes into qumixes. In this framework, one can give an abstract definition of the notions of superposition and of entangled pieces of information, quite independently of any numerical values. We investigate three different forms of abstract holistic quantum computational logic.