Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1306.6406

Aristotle's Logic Computed by Parametric Probability and Linear Optimization

Joseph W. Norman
View original source ↗Read source document ↗Export metadata ↓

Abstract

A new computational method is presented to implement the system of deductive logic described by Aristotle in Prior Analytics. Each Aristotelian problem is interpreted as a parametric probability network in which the premises give constraints on probabilities relating the problem's categorical terms (major, minor, and middle). Each probability expression from this network is evaluated to yield a linear function of the parameters in the probability model. By this approach the constraints specified as premises translate into linear equalities and inequalities involving a few real-valued variables. The problem's figure (schema) describes which specific probabilities are constrained, relative to those that are queried. Using linear optimization methods, the minimum and maximum feasible values of certain queried probabilities are computed, subject to the constraints given as premises. These computed solutions determine precisely which conclusions are necessary consequences of the premises. In this way, Aristotle's logical deductions can be accomplished by means of numerical computation.

Explore related subjects

math.LOmath.OCmath.PR

Keep this discovery

BibTeXRIS

Joseph W. Norman. 2013-06-27. Aristotle's Logic Computed by Parametric Probability and Linear Optimization. https://arxiv.org/abs/1306.6406

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↗