4 research outputs found

    Factor Varieties and Symbolic Computation

    Get PDF
    We propose an algebraization of classical and non-classical logics, based on factor varieties and decomposition operators. In particular, we provide a new method for determining whether a propositional formula is a tautology or a contradiction. This method can be autom-atized by defining a term rewriting system that enjoys confluence and strong normalization. This also suggests an original notion of logical gate and circuit, where propositional variables becomes logical gates and logical operations are implemented by substitution. Concerning formulas with quantifiers, we present a simple algorithm based on factor varieties for reducing first-order classical logic to equational logic. We achieve a completeness result for first-order classical logic without requiring any additional structure

    Sequent calculi of finite dimension

    Full text link
    In recent work, the authors introduced the notion of n-dimensional Boolean algebra and the corresponding propositional logic nCL. In this paper, we introduce a sequent calculus for nCL and we show its soundness and completeness.Comment: arXiv admin note: text overlap with arXiv:1806.0653

    Classical logic with n truth values as a symmetric many-valued logic

    Get PDF
    We introduce Boolean-like algebras of dimension n (nBA s) having n constants e1, … , en, and an (n+ 1) -ary operation q (a “generalised if-then-else”) that induces a decomposition of the algebra into n factors through the so-called n-central elements. Varieties of nBA s share many remarkable properties with the variety of Boolean algebras and with primal varieties. The nBA s provide the algebraic framework for generalising the classical propositional calculus to the case of n–perfectly symmetric–truth-values. Every finite-valued tabular logic can be embedded into such a n-valued propositional logic, nCL , and this embedding preserves validity. We define a confluent and terminating first-order rewriting system for deciding validity in nCL , and, via the embeddings, in all the finite tabular logics
    corecore