Dov Gabbay and the mathematics of Talmudic reasoning
The claim that Talmudic argument has formal structure is not a metaphor waiting for a mathematician. The mathematician arrived. For more than three decades Dov M. Gabbay has built the machinery — labelled deduction, fibring, reactive semantics — that makes provenance, combination and self-revision into first-class objects of logic, and since 2008 he has been turning it, one principle at a time, onto the Talmud.
Who he is
Dov M. Gabbay is a logician whose work sits at the junction of mathematical logic, computer science and artificial intelligence. In the 2018 second edition of the Handbook of Philosophical Logic he is listed with the Department of Computer Science, King's College London. He is the founding co-editor, with Franz Guenthner, of that Handbook — the reference work whose first edition the Encyclopaedia Britannica main logic article (1999) described as
the best starting point for exploring any of the topics in logic Quoted by the editors in "Preface to the Second Edition," Handbook of Philosophical Logic Vol. 18, p. vii (Springer, 2018)
He is the originator of Labelled Deductive Systems (LDS), a programme he has advanced since the end of the 1980s and set out in full in Labelled Deductive Systems, Volume 1 (Oxford Logic Guides 33, Clarendon Press, 1996), and of fibring as a general mechanism for combining logics (Fibring Logics, Oxford Logic Guides 38, Oxford University Press, 1999). Since 2008 he has co-directed, with Michael Abraham, Uri Schild and others, the Talmudic Logic Project.
The programme is best described in a reviewer's words. Traditional logic manipulates formulas; LDS manipulates pairs — a formula together with a label that may be a term, another logic's formula, a resource, or an entire database, and that guides the inference:
⟨ label , formula ⟩
Traditional logic manipulates formulas. Gabbay's message is to manipulate pairs — formulas and labels. Geert-Jan M. Kruijff, review of Labelled Deductive Systems, Volume 1, Journal of Logic, Language, and Information 7: 502–507 (1998)
The same review characterises LDS as providing a general framework in which many of the new logics found across computer science can be presented and investigated — a methodology rather than a single logic.
The Talmudic Logic Project
Begun in 2008 and ongoing, the project's method is stated as two-way traffic: import modern logical methods into Talmudic study in order to open passages that cannot otherwise be addressed, and export from the Talmud new logical principles that are innovative and useful to contemporary logic. The Talmud is treated, in the authors' phrase, as
…employing a large number of logical components centuries ahead of their time. Gabbay, Schild & David, "The Talmudic Logic Project, Ongoing Since 2008," Logica Universalis 13(4): 425–442 (2019), abstract, p. 425
The output is a book series, Studies in Talmudic Logic, published by College Publications, London, in Hebrew and English — roughly one volume per Talmudic reasoning principle. By the end of 2019 the project reported thirteen books published, and the authors state they expect a further 25–30 volumes.
| Vol. | Title | Authors | Year |
|---|---|---|---|
| 1 | Non-Deductive Inferences in The Talmud | Abraham, Gabbay, Schild | 2010 |
| 2 | The Textual Inference Rules Klal uPrat: How the Talmud Defines Sets | Abraham, Gabbay, Hazut, Maruvka, Schild | 2010 |
| 3 | Talmudic Deontic Logic | Abraham, Gabbay, Schild | 2010 |
| 4 | Temporal Logic in the Talmud | Abraham, Belfer, Gabbay, Schild | 2011 |
| 5 | Resolution of Conflicts and Normative Loops in the Talmud | Abraham, Gabbay, Schild | 2011 |
| 7 | Delegation in Talmudic Logic | Abraham, Belfer, Gabbay, Schild | 2011 |
| 8 | Synthesis of Concepts in Talmudic Logic | Abraham, Belfer, Gabbay, Schild | 2012 |
| 9 | Analysis of Concepts in Talmudic Reasoning | Abraham, Belfer, Gabbay, Schild | 2014 |
| 10 | Principles of Talmudic Logic | Abraham, Gabbay, Schild | 2013 |
| 11 | Platonic Realism and Talmudic Reasoning | Abraham, Gabbay, Schild | 2014 |
| 12 | Fuzzy Logic and Quantum States in Talmudic Reasoning | Abraham, Belfer, Gabbay, Schild | 2015 |
| 13 | Partition Problems in Talmudic Reasoning | Abraham, Belfer, Gabbay, Schild | 2016 |
| 14 | Joint Ownership Partnership in Talmudic Reasoning | Abraham, Belfer, Gabbay, David E., David S., Schild | 2017 |
From formalism to modern AI
Each row pairs a formalism from the Gabbay programme with the capability it underwrites in a modern AI system, and names the publication that backs the link. This is the load-bearing table on this page: the argument is not that the Talmud resembles these systems, but that the formal objects have been built and published.
| Move | Formalism | Modern AI reading | Backing citation |
|---|---|---|---|
| Provenance-carrying assertion | Labelled Deductive Systems — inference manipulates ⟨label, formula⟩ pairs; the label may be a term, another logic's formula, a resource or a database, and guides the inference |
Every claim carries its provenance, confidence and derivation path inside the inference, not as detached metadata. Trust becomes computable and revisable. | Gabbay, Labelled Deductive Systems, Vol. 1, Oxford Logic Guides 33 (1996) |
| Preserved disagreement | Abstract argumentation frameworks — a debate is an attack graph; extensions are the defensible sets; mutually attacking arguments are undecided rather than resolved | Debate graphs with formal attack semantics. A losing position keeps standing status instead of being deleted — the structural answer to a system that edits its own values away. | Dung, Artificial Intelligence 77(2): 321–357 (1995) † |
| Combining perspectives without collapse | Fibring — a general mechanism for combining logics, with transfer and preservation results (completeness of a combined system transferring from its components) | Multi-logic verdict vectors: classical, defeasible, temporal, authority and probabilistic assessments coexist rather than being flattened into one score. | Gabbay, Fibring Logics, Oxford Logic Guides 38 (1999) |
| Principled revision | AGM belief revision with non-monotonic consequence | Update as append-and-supersede rather than overwrite; conclusions retractable when evidence arrives, with rationality postulates constraining what a legitimate update looks like. | Frontiers in Belief Revision, Kluwer Applied Logic Series 22 (2001), series ed. Gabbay |
| Self-modifying evaluation | Reactive Kripke semantics — traversing an edge can switch other edges on or off, with completeness theorems and a proven correspondence to argumentation networks | An evaluation procedure that rewrites its own accessibility structure as context changes — and still has a soundness and completeness basis. The nearest formal handle on a system that revises its own criteria. | Gabbay, Reactive Kripke Semantics, Springer (2013); correspondence per Ann. Math. AI 66: 1–5 (2012) |
| Bounded exceptions | Calculus of cancellations — a Talmudic construct the project exports into modern logic; applied to reduce automaton state counts | Rules that cancel or suspend other rules in a controlled way: the formal shape of a scoped, auditable exception rather than an ad-hoc override. | Gabbay, Schild & David, Logica Universalis 13(4) (2019), p. 431 |
| Identity through change | Construction history and purpose as object properties — an object's identity depends on how it was made and what it is for | Ship of Theseus, formalised. A criterion for whether a system that has rewritten all its parts is still the same system — stated in terms of construction history and purpose rather than substrate. | Gabbay, Schild & David, Logica Universalis 13(4) (2019), pp. 432–433 |
| A fortiori inference | Matrix abduction — a {0,1} matrix with blanks ai,j = ?; an algorithm over superiority relations on partial orders decides 0, 1, or undecided |
Non-deductive inference made algorithmic and auditable, with undecided as a first-class output rather than a forced guess. | Abraham, Gabbay & Schild, Studia Logica 92(3): 281–364 (2009) |
† The Dung 1995 citation is recorded here from a secondary reference list rather than from the paper itself; volume, issue, pages and year should be confirmed against the publisher before being relied on. Every other row in this table was checked against the publication named in it.
Marking a citation as second-hand rather than quietly presenting it as verified is the same discipline the rest of this site argues for. A source note is cheaper than a retraction.
In his own words
All from Gabbay, Schild & David, "The Talmudic Logic Project, Ongoing Since 2008," Logica Universalis 13(4): 425–442 (2019) — an open-access paper, so these can be read in full context at the source.
If the purpose of the process is to have a ship to actually sail, then the "main" ship is the one with the new parts. Logica Universalis 13(4), p. 433 — the Talmud's resolution of the Theseus paradox
Classical logic dealing with object-change lacks this point of view, and therefore faces paradoxes and problems. Logica Universalis 13(4), p. 433
This is not easy to formalise in modern logic, and we need a calculus of cancellations. Logica Universalis 13(4), p. 431
The Theseus passage is the one to sit with. In context the authors work it through a concrete case — a stolen computer that has since been upgraded, where the thief argues it is no longer the same machine — and resolve it by appeal to purpose. Which means: is it still the same thing after every part has been replaced? is not a new question raised by self-modifying software. It is an old question with a worked formal treatment, and the answer turns on construction history and purpose.
Further reading
Bibliographic entries only. This site does not host or link copies of subscription-acquired papers; cite by DOI and read at the publisher. The Logica Universalis 2019 project overview is open access and is the best public entry point.
The Talmudic logic papers
Abraham, M., Gabbay, D. M. & Schild, U. "Analysis of the Talmudic Argumentum A Fortiori Inference Rule (Kal Vachomer) using Matrix Abduction." Studia Logica 92(3): 281–364 (2009). Special issue New Ideas in Applied Logic, ed. D. M. Gabbay & J. Malinowski. DOI: 10.1007/s11225-009-9202-5.
Gabbay, D. M., Schild, U. & David, E. "The Talmudic Logic Project, Ongoing Since 2008." Logica Universalis 13(4): 425–442 (2019). Birkhäuser / Springer. DOI: 10.1007/s11787-019-00228-y. Published online 15 November 2019. Open access.
Abraham, M., Gabbay, D. M. & Schild, U. "Principles of Talmudic Logic." In D. M. Gabbay & F. Guenthner (eds.), Handbook of Philosophical Logic, Volume 18 (2nd edn), pp. 133–375. Springer Nature Switzerland AG, 2018. Print ISBN 978-3-319-97754-6; DOI: 10.1007/978-3-319-97755-3. At 243 pages of a 387-page volume, the longest item in the book.
Abraham, M., Gabbay, D. & Schild, U. Studies in Talmudic Logic, Volume 10: Principles of Talmudic Logic, 296 pp. College Publications, London (2013). A distinct work from the Handbook chapter of the same name — do not conflate the two.
Abraham, M., Belfer, I., Gabbay, D. M. & Schild, U. "Future determination of entities in Talmudic logic." Journal of Applied Logic 11(1): 63–90 (2013).
Abraham, M., Belfer, I., Gabbay, D. M. & Schild, U. "Delegation, count-as and security in Talmudic logic, a preliminary study." In J.-Y. Béziau & M. Coniglio (eds.), Logic without Frontiers: Festschrift for Walter Alexandre Carnielli. College Publications, London (December 2011).
The general logical programme
Gabbay, D. M. Labelled Deductive Systems, Volume 1. Oxford Logic Guides, Volume 33. Oxford: Clarendon Press / Oxford Science Publications, 1996. xiv + 497 pp. ISBN 0-19-853833-2.
Gabbay, D. M. Fibring Logics. Oxford Logic Guides, Volume 38. New York: Oxford University Press, 1999. xiii + 475 pp. ISBN 0-19-850381-4.
Basin, D., D'Agostino, M., Gabbay, D. M., Matthews, S. & Viganò, L. (eds.) Labelled Deduction. Kluwer, Applied Logic Series vol. 17 (2000). DOI: 10.1007/978-94-011-4040-9. Post-proceedings of LD'98, Freiburg. A different work from Labelled Deductive Systems above, and four years later; the two are routinely conflated in secondary citations.
Carnielli, W., Coniglio, M., Gabbay, D. M., Gouveia, P. & Sernadas, C. Analysis and Synthesis of Logics: How to Cut and Paste Reasoning Systems. Springer, Applied Logic Series vol. 35 (2008). DOI: 10.1007/978-1-4020-6782-2.
Gabbay, D. M. Reactive Kripke Semantics. Springer, Cognitive Technologies series (2013). DOI: 10.1007/978-3-642-41389-6.
Gabbay, D. M. "Overview on the connection between reactive Kripke models and argumentation networks." Annals of Mathematics and Artificial Intelligence 66: 1–5 (2012). DOI: 10.1007/s10472-012-9312-z.
Context and reviews
Dung, P. M. "On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games." Artificial Intelligence 77(2): 321–357 (1995). Recorded from a secondary reference list; confirm against the publisher.
Kruijff, G.-J. M. Review of Labelled Deductive Systems, Volume 1. Journal of Logic, Language, and Information 7: 502–507 (1998).
Sernadas, A. Review of Fibring Logics. Journal of Logic, Language and Information 9: 511–513 (2000).
Talmudic Logic
The thirteen middot, kal va-chomer as matrix abduction, and the seven operations of a sugya read as computations over an argument graph.
The Sugya Protocol
These formalisms turned into an engineering methodology for knowledge bases that can be updated without amnesia.
TalmudicLogic.com →
The deep interactive treatment: each inference rule with its canonical sugya and the formal framework that models it.