This work presents an operational and geometric approach to logic. It starts from the multilinear elective decomposition of binary logical functions in the original form introduced by George Boole [1]. A justification on historical grounds is presented bridging Boole's theory and the use of his arithmetical logical functions with the axioms of Boolean algebra using sets and quantum logic. It is shown that the algebraic polynomial formulation can be naturally extended to operators in vector spaces. In this way propositional logic can be formalized in linear algebra by using combinations of tensored elementary operators. The original and principal motivation of this work is for applications in the new field of quantum information, differences are outlined with more traditional quantum logic approaches. This formulation is named Eigenlogic. The interesting feature is that the eigenvalues of these operators are the truth values of the corresponding logical connective and the associated eigenvectors correspond to one of the fixed combinations of the inputs (interpretations). The outcome of a " measurement " or " observation " on a logical observable will give the truth value of the associated logical proposition , and becomes " interpretable " when applied to its eigenspace leading to a natural analogy with the measurement postulate in quantum mechanics. One can generalize to eigenvalues different from the Boolean binary values {0, 1} for example with {+1, 1} associated to self-inverse unitary operators. In general one can associate a binary logical operator with whatever couple of distinct eigenvalues {λ1, λ2}, the corresponding family of logical operators can be found by Lagrange-Cayley-Hamilton matrix interpolation methods. The extension from binary to many-valued logic is then considered by defining specific operators using multivariate interpolation. The interesting property is that a unique seed operator generates the complete logical family of operators for a given m-valued n-arity system. This method can be applied to the synthesis of binary and multivalued quantum logical gates. Eigenlogic brings a correspondence between control logic (David Deutsch's quantum logical gate paradigm) and ordinary propositional logic. Several of the logical observables turn out to be well-known quantum gates. It is well known that the 2-quibit entangling Cz gate in association with 1-quibit gates is universal. In Eigenlogic the Cz gate becomes the AND gate. Following this approach a new design method of the universal Toffoli gate, using T gates is proposed. Ternary-logic quantum gates using qutrits lead to less complex circuits, the design of a balanced qutrit arithmetic full-calculator circuit is realized by using Eigenlogic. In Eigenlogic all propositional binary and multivalued logic can be built on the basis of a complete family of commuting logical observables. With non-eigenvectors the logical operators are no more diagonal and correspond to propositions with fuzzy interpretation: the degree of truth corresponding to the fuzzy membership function dened by the mean value (Born rule) applied on the logical observables. Also when using two maximally incompatible logical families such as those generated by the X and Z gates one gets an interesting outlook: the usual Grover gate turns out to be a logical disjunction operator (OR) in the X system and can be interpreted in the Z system as the predicative existential logical connective. This could permit to extend the Eigenlogic approach towards rst-order logic.