Abstract

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.