Qal wa- omer and Theory of Massive-Parallel Proofs

History and Philosophy of Logic 32 (1):71-83 (2011)
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
Keywords No keywords specified (fix it)
Categories
Options
 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: 5,701
External links
  • Through your library Configure

    Similar books and articles
    Carlo Cellucci (2008). Why Proof? What is a Proof? In Giovanna Corsi & Rossella Lupacchini (eds.), Deduction, Computation, Experiment. Exploring the Effectiveness of Proof, pp. 1-27. Springer.
    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.

    Analytics

    Monthly downloads

    Added to index

    2011-02-09

    Total downloads

    12 ( #93,408 of 549,124 )

    Recent downloads (6 months)

    1 ( #63,361 of 549,124 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


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

    Other forums