Abstract
We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix $${\mathbb {A}}$$ with entries in {0, 1}, we allow for one or more blank squares in the matrix, say a i,j =?. The method allows us to decide whether to declare a i,j = 0 or a i,j = 1 or a i,j =? undecided. This algorithmic method is then applied to modelling several legal and practical reasoning situations including the Talmudic rule of Kal-Vachomer. We add an Appendix showing that this new rule of Matrix Abduction, arising from the Talmud, can also be applied to the analysis of paradoxes in voting and judgement aggregation. In fact we have here a general method for executing non-deductive inferences.