This book examines in detail a number of typical lengthy passages with a view to showing how Talmudic reasoning operates and how the Talmud was compiled by its final editors.

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. (shrink)

This paper examines the deontic logic of the Talmud. We shall find, by looking at examples, that at first approximation we need deontic logic with several connectives: O T A Talmudic obligation F T A Talmudic prohibition F D A Standard deontic prohibition O D A Standard deontic obligation. In classical logic one would have expected that deontic obligation O D is definable by $O_DA \equiv F_D\neg A$ and that O T and F T are connected by $O_TA \equiv F_T\neg (...) A$ This is not the case in the Talmud for the T (Talmudic) operators, though it does hold for the D operators. We must change our underlying logic. We have to regard {O T , F T } and {O D , F D } as two sets of operators, where O T and F T are independent of one another and where we have some connections between the two sets. We shall list the types of obligation patterns appearing in the Talmud and develop an intuitionistic deontic logic to accommodate them. We shall compare Talmudic deontic logic with modern deontic logic. (shrink)

In this article, the author attempts to explicate the notion of the best known Talmudic inference rule called qal wa- omer. He claims that this rule assumes a massive-parallel deduction, and for formalizing it, he builds up a case of massive-parallel proof theory, the proof-theoretic cellular automata, where he draws conclusions without using axioms.

In this article, the author attempts to explicate the notion of the best known Talmudic inference rule called qal wa-omer. He claims that this rule assumes a massive-parallel deduction, and for formalizing it, he builds up a case of massive-parallel proof theory, the proof-theoretic cellular automata, where he draws conclusions without using axioms.