Qal wa- omer and Theory of Massive-Parallel Proofs

History and Philosophy of Logic 32 (1):71-83 (2011)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 12,997
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Andrew Schumann (2008). Non-Archimedean Fuzzy and Probability Logic. Journal of Applied Non-Classical Logics 18 (1):29-48.
Citations of this work BETA
Similar books and articles
Andrew Wells (1993). Parallel Architectures and Mental Computation. British Journal for the Philosophy of Science 44 (3):531-542.
Andrew Boucher (1997). Parallel Machines. Minds and Machines 7 (4):543-551.
Peter Carruthers (2006). Simple Heuristics Meet Massive Modularity. In Peter Carruthers, Stephen Laurence & Stephen P. Stich (eds.), The Innate Mind: Culture and Cognition. Oxford University Press.

Monthly downloads

Added to index


Total downloads

13 ( #136,613 of 1,410,059 )

Recent downloads (6 months)

1 ( #177,059 of 1,410,059 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.