An algebraic treatment of propositional logic
DOI:
https://doi.org/10.15381/tesis.v10i11.18678Keywords:
Propositional logic, Algebraic interpretation, Boolean algebra, Algebraic reductionAbstract
Propositional logical language is translated into algebraic language. For this it establishes two fundamental correspondences, that exists between the truth (V) and the zero (0) and that which relates the falsehood (F) with the one (1). These correspondences establish the algebraic equivalent of each one of the operators of the propositional logic and, in turn, allow to reduce by algebraic means any formula of propositional logic. If the formula in question is tautological, its algebraic version is reductible to 0; If the formula is contradictory, its algebraic version is reductible to 1 and if the formula is contingent, its algebraic version is not reduced to 0 or to 1, but to an expression of smaller extension that admits between the values of its algebraic matrix at least a 0 and at least A 1.
Downloads
Published
Issue
Section
License
Copyright (c) 2017 Miguel Ángel Merma Mora
This work is licensed under a Creative Commons Attribution 4.0 International License.
THE AUTHORS RETAIN THEIR RIGHTS:
(a) The authors retain their trademark and patent rights, and also on any process or procedure described in the article.
(b) The authors retain the right to share, copy, distribute, execute and publicly communicate the article published in Tesis (Lima) (in example, depositing the article in an institutional repository or publish it in a book), with recognition of its initial publication in the Tesis (Lima).
(c) The authors retain the right to make a later publication of their work, to use the article or any part of it (for example: a compilation of their works, notes for conferences, thesis, or for a book), provided that they indicate the source of publication (authors of the work, magazine, volume, number and date).
