In this paper we discuss the notions of adequacy and truth functionality in quantum logic from the point of view of a non-deterministic semantics. We give a characterization of the degree of non-functionality which is compatible with the propositional structure of quantum theory, showing that having truth-functional connectives, together with some assumptions regarding the relation of logical consequence, commits us to the adequacy of the interpretation sets of these connectives. An advantage of our proof is that it is independent of (...) the number of truth values involved, generalizing previous works. We also show the failure of the adequacy of every Nmatrix that is a model of the non-distributive lattice of quantum propositions. En este trabajo discutimos las nociones de adecuación y veritativo-funcionalidad en la lógica cuántica, desde el punto de vista de una semántica no determinista. Damos una caracterización del grado de no-funcionalidad compatible con la estructura proposicional de la teoría cuántica, mostrando que tener conectivos veritativo-funcionales, junto con algunos presupuestos relativos a la relación de consecuencia lógica, nos compromete con la adecuación de los conjuntos de interpretación de estos conectivos. Un punto ventajoso de nuestra prueba es que se independiza de la cantidad de valores de verdad involucrados, generalizando trabajos previos. Probamos también que falla la adecuación de cualquier Nmatriz que sirva como modelo para el retículo no distributivo de proposiciones cuánticas. (shrink)

This paper introduces the theory QST of quasets as a formal basis for the Nmatrices. The main aim is to construct a system of Nmatrices by substituting standard sets by quasets. Since QST is a conservative extension of ZFA (the Zermelo-Fraenkel set theory with Atoms), it is possible to obtain generalized Nmatrices (Q-Nmatrices). Since the original formulation of QST is not completely adequate for the developments we advance here, some possible amendments to the theory are also (...) considered. One of the most interesting traits of such an extension is the existence of complementary quasets which admit elements with undetermined membership. Such elements can be interpreted as quantum systems in superposed states. We also present a relationship of QST with the theory of Rough Sets RST, which grants the existence of models for SQT formed by rough sets. Some consequences of the given formalism for the relation of logical consequence are also analysed. (shrink)

By elaborating on the results presented in Lógica cuántica, Nmatrices y adecuación I, here we discuss the notions of adequacy and truth functionality in quantum logic from the point of view of a non-deterministic semantics based on Nmatrices. We present a proof of the impossibility of providing a functional semantics for the quantum lattice. An advantage of our proof is that it is independent of the number of truth values involved, generalizing previous works. Due to the impossibility of (...) defining adequate interpreting sets for the conjunction and disjunction (as was shown in our previous work), it follows that a homomorphism between the lattice of quantum projections and a Boolean algebra of n-elements cannot exist. (shrink)

In abstract algebraic logic, many systems, such as those paraconsistent logics taking inspiration from da Costa's hierarchy, are not algebraizable by even the broadest standard methodologies, as that of Blok and Pigozzi. However, these logics can be semantically characterized by means of non-deterministic algebraic structures such as Nmatrices, RNmatrices and swap structures. These structures are based on multialgebras, which generalize algebras by allowing the result of an operation to assume a non-empty set of values. This leads to an interest (...) in exploring the foundations of multialgebras applied to the study of logic systems. -/- It is well known from universal algebra that, for every signature Sigma, there exist algebras over Sigma which are absolutely free, meaning that they do not satisfy any identities or, alternatively, satisfy the universal mapping property for the class of Sigma-algebras. Furthermore, once we fix a cardinality of the generating set, they are, up to isomorphisms, unique, and equal to algebras of terms (or propositional formulas, in the context of logic). Equivalently, the forgetful functor, from the category of Sigma-algebras to Set, has a left adjoint. This result does not extend to multialgebras. Not only multialgebras satisfying the universal mapping property do not exist, but the forgetful functor U, from the category of Sigma-multialgebras to Set, does not have a left adjoint. -/- In this paper we generalize, in a natural way, algebras of terms to multialgebras of terms, whose family of submultialgebras enjoys many properties of the former. One example is that, to every pair consisting of a function, from a submultialgebra of a multialgebra of terms to another multialgebra, and a collection of choices (which selects how a homomorphism approaches indeterminacies), there corresponds a unique homomorphism, what resembles the universal mapping property. Another example is that the multialgebras of terms are generated by a set that may be viewed as a strong basis, which we call the ground of the multialgebra. Submultialgebras of multialgebras of terms are what we call weakly free multialgebras. Finally, with these definitions at hand, we offer a simple proof that multialgebras with the universal mapping property for the class of all multialgebras do not exist and that U does not have a left adjoint. (shrink)