Notre Dame Journal of Formal Logic 30 (2):207-223 (1989)
A practical system of reasoning must be both correct and efficient. An efficient system which contains a large body of information can not search for the proof of a conclusion from all information available. Efficiency requires that deduction of the conclusion be carried out in a modular way using only a relatively small and quickly identified subset of the total information. One might assume that data modularity is incompatible with correctness, where a system is correct for a logic L iff it proves exactly what is valid in L. We point out that modularity and correctness are indeed incompatible if the logic in question is classical. On the other hand, the two desiderata are compatible for relevance logic. Furthermore, Horn clause resolution theorem proving is modular (this helps explain its relative efficiency) and the logic for which it is correct is relevance logic not classical logic
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
What Can Developmental Disorders Tell Us About Modularity?Gary F. Marcus - 2002 - Behavioral and Brain Sciences 25 (6):762-763.
Against Modularity.William Marslen-Wilson & Lorraine Komisarjevsky Tyler - 1987 - In Modularity In Knowledge Representation And Natural- Language Understanding. Cambridge: MIT Press.
Assembling the Emotions.Vincent Bergeron & Mohan Matthen - 2008 - In Luc Faucher & Christine Tappolet (eds.), The Modularity of Emotions. University of Calgary Press. pp. 185-212.
Moderately Massive Modularity.Peter Carruthers - 2003 - In Anthony O'Hear (ed.), Royal Institute of Philosophy Supplement. Cambridge University Press. pp. 67-89.
Cognitive Modularity, Biological Modularity and Evolvability.Claudia Lorena García - 2007 - Biological Theory: Integrating Development, Evolution and Cognition (KLI) 2 (1):62-73.
Introduction: Modularity and the Nature of Emotions.Luc Faucher & Christine Tappolet - 2007 - Canadian Journal of Philosophy 36 (5S).
What Computers (Still, Still) Can't Do: Jerry Fodor on Computation and Modularity.Robert A. Wilson - 2008 - In Robert J. Stainton (ed.), New Essays in Philosophy of Language and Mind. University of Calgary Press. pp. 407-425.
Modularity and Naturalism in Theories of Vision.Neil Stillings - 1987 - In Modularity In Knowledge Representation. Cambridge: MIT Press.
There Exist Exactly Two Maximal Strictly Relevant Extensions of the Relevant Logic R.Kazimierz Swirydowicz - 1999 - Journal of Symbolic Logic 64 (3):1125-1154.
What Is a Good Domain Description? Evaluating and Revising Action Theories in Dynamic Logic.Ivan Varzinczak - 2006 - Dissertation, Université Paul Sabatier
Substructural Implicational Logics Including the Relevant Logic E.Ryo Kashima & Norihiro Kamide - 1999 - Studia Logica 63 (2):181-212.
Added to index2010-08-24
Total downloads9 ( #458,130 of 2,158,366 )
Recent downloads (6 months)1 ( #355,511 of 2,158,366 )
How can I increase my downloads?