Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1608.04654

Differential and Integral Calculus for Logical Operations. A Matrix-Vector Approach

Eduardo Mizraji
View original source ↗Read source document ↗Export metadata ↓

Abstract

A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend this kind of calculus in order to include the semantic of classical logical operations. We show that this extension to logics is strongly helped if we submerge the elementary logical calculus in a matrix-vector formalism that naturally includes a kind of fuzzy-logic. In this way, guided by the laws of matrix algebra, we can construct compact representations for the derivatives and the integrals of logical functions. Inside this semantic-algebraic calculus, we obtain expressions for the derivatives of some of the basic logical operations and show the general way to obtain the derivatives of any well-formed formula of propositional calculus. We show that some of the basic tautologies (Excluded middle, Modus ponens, Hypothetical syllogism) are members of a kind of hierarchical system linked by the differentiation algorithm. In addition using the logical derivatives we show that relatively complex formulas can collapse in simple expressions that reveal clearly their hidden logical meaning. The search for the antiderivatives produces naturally an integral calculus. Within this logical formalism an indefinite integral can always be found for any logical expression. Moreover, particular integrals can be constructed based on detachment properties that lead to logical expressions of growing complexity. We show that these particular integrals have some similarities with the 'generalizing deduction' procedures investigated by Lukasiewicz.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Eduardo Mizraji. 2016-08-16. Differential and Integral Calculus for Logical Operations. A Matrix-Vector Approach. https://doi.org/10.1093/logcom/exu020

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗