Skip to main content
SpringerLink
Log in
Book cover

Handbook of Philosophical Logic pp 1–128Cite as

Relevance Logic

  • Chapter

Part of the book series: Handbook of Philosophical Logic ((HALO,volume 6))

Abstract

The title of this piece is not ‘A Survey of Relevance Logic’. Such a project was impossible in the mid 1980s when the first version of this article was published, due to the development of the field and even the space limitations of the Handbook. The situation is if anything, more difficult now. For example Anderson and Belnap and Dunn’s two volume [1975; 1992] work Entailment: The Logic of Relevance and Necessity, runs to over 1200 pages, and is their summary of just some of the work done by them and their coworkers up to about the late 1980s. Further, the comprehensive bibliography (prepared by R. G. Wolf) contains over 3000 entries in work on relevance logic and related fields.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Wilhelm Ackermann. Begründung einer strengen implikation. Journal of Symbolic Logic, 21: 113–128, 1956.

    Google Scholar 

  2. Seiki Akama. Relevant counterfactuals and paraconsistency. In Proceedings of the First World Conference on Paraconsistency, Gent, Belgium., 1997.

    Google Scholar 

  3. Gerard Allwein and J. Michael Dunn. A kripke semantics for linear logic. Journal of Symbolic Logic, 58 (2): 514–545, 1993.

    Google Scholar 

  4. A. R. Anderson and N. D. Belnap Jr. Modalities in Ackermann’s ‘rigorous implication’. Journal of Symbolic Logic, 24: 107–111, 1959.

    Google Scholar 

  5. A. R. Anderson and N. D. Belnap Jr. A simple proof of Gödel’s completeness theorem. Journal of Symbolic Logic,24:320–321, 1959. (Abstract.).

    Google Scholar 

  6. A. R. Anderson and N. D. Belnap Jr. Enthymemes. Journal of Philosophy, 58: 713–723, 1961.

    Google Scholar 

  7. A. R. Anderson and N. D. Belnap Jr. The pure calculus of entailment. Journal of Symbolic Logic, 27: 19–52, 1962.

    Google Scholar 

  8. A. R. Anderson and N. D. Belnap Jr. Tautological entailments. Philosophical Studies, 13: 9–24, 1962.

    Google Scholar 

  9. Alan Ross Anderson and Nuel D. Belnap. Entailment: The Logic of Relevance and Necessity, volume 1. Princeton University Press, Princeton, 1975.

    Google Scholar 

  10. Alan Ross Anderson, Nuel D. Belnap, and J. Michael Dunn. Entailment: The Logic of Relevance and Necessity, volume 2. Princeton University Press, Princeton, 1992.

    Google Scholar 

  11. A. R. Anderson. Entailment shorn of modality. Journal of Symbolic Logic,25:388, 1960. (Abstract.).

    Google Scholar 

  12. A. R. Anderson. Some open problems concerning the system E of entailment. Acta Philosophica Fennica, 16: 7–18, 1963.

    Google Scholar 

  13. Arnon Avron. On purely relevant logics. Notre Dame Journal of Formal Logic, 27: 180–194, 1986.

    Google Scholar 

  14. Arnon Avron. Relevance and paraconsistency — a new approach. Journal of Symbolic Logic, 55: 707–732, 1990.

    Google Scholar 

  15. Arnon Avron. Relevance and paraconsistency — a new approach. Part II: The formal systems. Notre Dame Journal of Formal Logic, 31: 169–202, 1990.

    Google Scholar 

  16. Arnon Avron. Relevance and paraconsistency — a new approach. Part III: Cut-free gentzen-type systems. Notre Dame Journal of Formal Logic, 32: 147–160, 1990.

    Google Scholar 

  17. Arnon Avron. Simple consequence relations. Information and Computation, 92: 105–139, 1991.

    Google Scholar 

  18. Arnon Avron. Whither relevance logic? Journal of Philosophical Logic, 21: 243–281, 1992.

    Google Scholar 

  19. R. C. Barcan Marcus. The deduction theorem in a functional calculus of first-order based on strict implication. Journal of Symbolic Logic, 11: 115–118, 1946.

    Google Scholar 

  20. Jon Barwise and John Perry. Situations and Attitudes. MIT Press, Bradford Books, 1983.

    Google Scholar 

  21. Nuel D. Belnap and J. Michael Dunn. Entailment and the disjunctive syllogism. In F. Flbistad and G. H. von Wright, editors, Philosophy of Language/Philosophical Logic,pages 337–366. Martinus Nijhoff, The Hague, 1981. Reprinted as Section 80 in Entailment Volume 2, [Anderson et al.,1992].

    Google Scholar 

  22. Nuel D. Belnap and J. H. Spencer. Intensionally complemented distributive lattices. Portugaliae Mathematica, 25: 99–104, 1966.

    Google Scholar 

  23. N. D. Belnap Jr. and J. R. Wallace. A decision procedure for the system Eti of entailment with negation. Technical Report 11, Contract No. SAR/609 (16), Office of Naval Research, New Haven, 1961. Also published as [Belnap and Wallace, 1965 ].

    Google Scholar 

  24. N. D. Belnap Jr., A. Gupta, and J. Michael Dunn. A consecution calculus for positive relevant implication with necessity. Journal of Philosophical Logic,9:343–362, 1980.

    Google Scholar 

  25. Nuel D. Belnap. EQ and the first-order functional calculus. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 6: 217–218, 1960.

    Google Scholar 

  26. Nuel D. Belnap. A formal analysis of entailment. Technical Report Contract No. SAR/Nonr. 609(16), Office of Naval Research, New Haven, 1960.

    Google Scholar 

  27. Nuel D. Belnap. Tonk, plonk and plink. Analysis, 22: 130–134, 1962.

    Google Scholar 

  28. Nuel D. Belnap. Intensional models for first degree formulas. Journal of Symbolic Logic, 32: 1–22, 1967.

    Google Scholar 

  29. Nuel D. Belnap. Special cases of the decision problem of relevant implication. Journal of Symbolic Logic,32:431–432, 1967. (Abstract.).

    Google Scholar 

  30. Nuel D. Belnap. How a computer should think. In G. Ryle, editor, Contemporary Aspects of Philosophy. Oriel Press, 1977.

    Google Scholar 

  31. Nuel D. Belnap. A useful four-valued logic. In J. Michael Dunn and George Epstein, editors, Modern Uses of Multiple-Valued Logics, pages 8–37. Reidel, Dordrecht, 1977.

    Google Scholar 

  32. A. Bialynicki-Birula and H. Rasiowa. On the representation of quasi-boolean algebras. Bulletin de L’académie Polonaise des Sciences, 5: 259–261, 1957.

    Google Scholar 

  33. Ross T. Brady. The non-triviality of dialectical set theory. In Graham Priest, Richard Routley, and Jean Norman, editors, Paraconsistent Logic: Essays on the Inconsistent, pages 437–470. Philosophia Verlag, 1989.

    Google Scholar 

  34. Ross T. Brady. Gentzenization and decidability of some contraction-less relevant logics. Journal of Philosophical Logic, 20: 97–117, 1991.

    Google Scholar 

  35. Ross T. Brady. Rules in relevant logic — I: Semantic classification. Journal of Philosophical Logic, 23: 111–137, 1994.

    Google Scholar 

  36. Ross T. Brady. Relevant implication and the case for a weaker logic. Journal of Philosophical Logic, 25: 151–183, 1996.

    Google Scholar 

  37. J. P. Burgess. Relevance: A fallacy? Notre Dame Journal of Formal Logic, 22: 97–104, 1981.

    Google Scholar 

  38. H. N. Castafieda. Thinking and Doing: The Philosophical Foundations of Institutions. Reidel, Dordrecht, 1975.

    Google Scholar 

  39. G. W. Charlewood. Representations of Semilattice Relevance Logic. PhD thesis, University of Toronto, 1978.

    Google Scholar 

  40. G. W. Charlewood. An axiomatic version of positive semi-lattice relevance logic. Journal of Symbolic Logic, 46: 233–239, 1981.

    Google Scholar 

  41. Alonzo Church. The weak positive implication calculus. Journal of Symbolic Logic, 16: 238, 1951. Abstract of “The Weak Theory of Implication” [Church, 1951b ].

    Google Scholar 

  42. Alonzo Church. The weak theory of implication. In A. Menne, A. Wilhelmy, and H. Angsil, editors, Kontroliertes Denken: Untersuchungen zum Logikkalkül und zur Logik der Einzelwissenschaften, pages 22–37. Kommissions-Verlag Karl Al-ber, Munich, 1951. Abstracted in “The Weak Positive Implication Calculus” [Church, 1951a ].

    Google Scholar 

  43. M. Clark. The equivalence of tautological and ‘strict’ entailment: proof of an amended conjecture of lewy’s. Journal of Symbolic Logic, 9: 9–15, 1980.

    Google Scholar 

  44. B. J. Copeland. On when a semantics is not a semantics: some reasons for disliking the Routley-Meyer semantics for relevance logic. Journal of Philosophical Logic, 8: 399–413, 1979.

    Google Scholar 

  45. Haskell B. Curry. A Theory of Formal Deducibility, volume 6 of Notre Dame Mathematical Lectures. Notre Dame University Press, 1950.

    Google Scholar 

  46. Marcello D’Agostino and Dov M. Gabbay. A generalization of analytic deduction via labelled deductive systems. part I: Basic substructural logics. Journal of Automated Reasoning, 13: 243–281, 1994.

    Google Scholar 

  47. R. R. Dipert. Development and Crisis in Late Boolean Logic; The Deductive Logics of Peirce, Jevons and Schröder. PhD thesis, Indiana University, 1978.

    Google Scholar 

  48. Kosta Doren. Sequent systems and groupoid models, part 1. Studia Logica, 47: 353–386, 1988.

    Google Scholar 

  49. Kosta Doren. Sequent systems and groupoid models, part 2. Studia Logica, 48: 41–65, 1989.

    Google Scholar 

  50. Kosta Doren. The first axiomatisation of relevant logic. Journal of Philosophical Logic, 21: 339–356, 1992.

    Google Scholar 

  51. J. Michael Dunn and Robert K. Meyer. Algebraic completeness results for Dummett’s LC and its extensions. Zeitschrift far Mathematische Logik und Grundlagen der Mathematik, 17: 225–230, 1971.

    Google Scholar 

  52. J. Michael Dunn and Robert K. Meyer. Gentzen’s cut and Ackermann’s ry. In Richard Sylvan and Jean Norman, editors, Directions in Relevant Logic. Kluwer, Dordrecht, 1989.

    Google Scholar 

  53. J. Michael Dunn and Robert K. Meyer. Combinators and structurally free logic. Logic Journal of the IGPL, 5: 505–357, 1997.

    Google Scholar 

  54. J. Michael Dunn. The Algebra of Intensional Logics. PhD thesis, University of Pittsburgh, 1966.

    Google Scholar 

  55. J. Michael Dunn. The effective equivalence of certain propositions about De Morgan lattices. Journal of Symbolic Logic, 32: 433–434, 1967. (Abstract).

    Google Scholar 

  56. J. Michael Dunn. Natural language versus formal language. In Joint APAAPL Symposium, New York, December 17, 1969.

    Google Scholar 

  57. J. Michael Dunn. Algebraic completeness for R-mingle and its extensions. Journal of Symbolic Logic, 35: 1–13, 1970.

    Google Scholar 

  58. J. Michael Dunn. An intuitive semantics for first degree relevant implications (abstract). Journal of Symbolic Logic, 36: 363–363, 1971.

    Google Scholar 

  59. J. Michael Dunn. A ‘Gentzen’ system for positive relevant implication. Journal of Symbolic Logic, 38: 356–357, 1974. (Abstract).

    Google Scholar 

  60. J. Michael Dunn. Intuitive semantics for first-degree entailments and “coupled trees”. Philosophical Studies, 29: 149–168, 1976.

    Google Scholar 

  61. J. Michael Dunn. A Kripke-style semantics for R-mingle using a binary accessibility relation. Studia Logica, 35: 163–172, 1976.

    Google Scholar 

  62. J. Michael Dunn. Quantification and RM. Studia Logica, 35: 315–322, 1976.

    Google Scholar 

  63. J. Michael Dunn. A variation on the binary semantics for RM. Relevance Logic Newsletter, 1: 56–67, 1976.

    Google Scholar 

  64. J. Michael Dunn. R-mingle and beneath: Extensions of the RoutleyMeyer semantics for R. Notre Dame Journal of Formal Logic, 20: 369–376, 1979.

    Google Scholar 

  65. J. Michael Dunn. A theorem in 3-valued model theory with connections to number theory, type theory, and relevant logic. Studia Logica, 38: 149–169, 1979.

    Google Scholar 

  66. J. Michael Dunn. Relevant Robinson’s arithmetic. Studia Logica, 38: 407–418, 1980.

    Google Scholar 

  67. J. Michael Dunn. A sieve for entailments. Journal of Philosophical Logic, 9: 41–57, 1980.

    Google Scholar 

  68. J. Michael Dunn. Relevant predication 1: The formal theory. Journal of Philosophical Logic, 16: 347–381, 1987.

    Google Scholar 

  69. J. Michael Dunn. Relevant predication 2: Intrinsic properties and internal relations. Philosophical Studies, 60: 177–206, 1990.

    Google Scholar 

  70. J. Michael Dunn. Relevant predication 3: Essential properties. In J. Michael Dunn and Anil Gupta, editors, Truth or Consequences, pages 77–95. Kluwer, 1990.

    Google Scholar 

  71. J. Michael Dunn. Gaggle theory: An abstraction of Galois connections and residuation with applications to negation and various logical operations. In Logics in AI, Proceedings European Workshop JELIA 1990, volume 478 of Lecture Notes in Computer Science. Springer-Verlag, 1991.

    Google Scholar 

  72. J. Michael Dunn. Partial-gaggles applied to logics with restricted structural rules. In Peter Schroeder-Heister and Kosta Dosen, editors, Substructural Logics. Oxford University Press, 1993.

    Google Scholar 

  73. J. Michael Dunn. A representation of relation algebras using RoutleyMeyer frames. Technical report, Indiana University Logic Group Preprint Series, IULG-93–28, 1993.

    Google Scholar 

  74. J. Michael Dunn. Star and perp: Two treatments of negation. In James E. Tomberlin, editor, Philosophical Perspectives, volume 7, pages 331–357. Ridgeview Publishing Company, Atascadero, California, 1994.

    Google Scholar 

  75. J. Michael Dunn. Generalised ortho negation. In Heinrich Wansing, editor, Negation: A Notion in Focus, pages 3–26. Walter de Gruyter, Berlin, 1996.

    Google Scholar 

  76. R. Feys and J. Ladrière. Notes to recherches sur la déduction logique, 1955. Translation of “Untersuchungen über das logische Schliessen” [Gentzen, 1934 ], Paris.

    Google Scholar 

  77. Kit Fine. Models for entailment. Journal of Philosophical Logic, 3: 347–372, 1974.

    Google Scholar 

  78. Kit Fine. Semantics for quantified relevance logic. Journal of Philosophical Logic, 17: 27–59, 1988.

    Google Scholar 

  79. Kit Fine. Incompleteness for quantified relevance logics. In Jean Norman and Richard Sylvan, editors, Directions in Relevant Logic, pages 205–225. Kluwer Academic Publishers, Dordrecht, 1989.

    Google Scholar 

  80. Melvin C. Fitting. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11 (2): 91–116, 1989.

    Google Scholar 

  81. R. J. Fogelin. Understanding Arguments. Harcourt, Brace, Jovanovich, New York, 1978.

    Google Scholar 

  82. Harvey Friedman and Robert K. Meyer. Whither relevant arithmetic ? Journal of Symbolic Logic, 57: 824–831, 1992.

    Google Scholar 

  83. D. M. Gabbay. Investigations in Modal and Tense Logics with Applications to Problems in Philosophy and Linguistics. Reidel, Dordrecht, 1976.

    Google Scholar 

  84. Dov M. Gabbay. Labelled Deductive Systems. Number 33 in Oxford Logic Guides. Oxford University Press, 1997.

    Google Scholar 

  85. Gerhard Gentzen. Untersuchungen über das logische schliessen. Math. Zeitschrift, 39:176–210 Translated in The Collected Papers of Gerhard Gentzen [Gentzen, 1969 ].

    Google Scholar 

  86. Gerhard Gentzen. Untersuchungen über das logische schliessen. Math. Zeitschrift, 405–431, 1934. Translated in The Collected Papers of Gerhard Gentzen [Gentzen, 1969 ].

    Google Scholar 

  87. Gerhard Gentzen. The Collected Papers of Gerhard Gentzen. North Holland, 1969. Edited by M. E. Szabo.

    Google Scholar 

  88. Steve Giambrone. TW+ and RW+ are decidable. Journal of Philosophical Logic, 14: 235–254, 1985.

    Google Scholar 

  89. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50: 1–101, 1987.

    Google Scholar 

  90. H. P. Grice. Logic and conversation. In P. Cole and J. L. Morgan, editors, Syntax and Semantics: Speech Acts, volume 3, pages 41–58. Academic Press, New York, 1975. Reprinted in Jackson [Jackson, 1991 ].

    Google Scholar 

  91. S. Haack. Deviant Logic: Some Philosophical Issues. Cambridge University Press, 1974. Reissued as Deviant Logic, Fuzzy Logic: Beyond the Formalism [Haack, 1996 ].

    Google Scholar 

  92. Susan Haack. Deviant Logic, Fuzzy Logic: Beyond the Formalism. Cambridge University Press, 1996.

    Google Scholar 

  93. R. Harrop. Some structure results for propositional calculi. Journal of Symbolic Logic, 30: 271–292, 1965.

    Google Scholar 

  94. G. Hutchinson. Recursively unsolvable word problems of modular lattices and diagram chasing. Journal of Algebra, pages 385–399, 1973.

    Google Scholar 

  95. Frank Jackson, editor. Conditionals. Oxford Readings in Philosophy. Oxford, 1991.

    Google Scholar 

  96. Bjarni Jónsson and Alfred Tarski. Boolean algebras with operators: Part I. American Journal of Mathematics, 73: 891–939, 1951.

    Google Scholar 

  97. J. A. Kalman. Lattices with involution. Transactions of the American Mathematical Society, 87: 485–491, 1958.

    Google Scholar 

  98. Saul A. Kripke. A completeness theorem in modal logic. Journal of Symbolic Logic, 24: 1–15, 1959.

    Google Scholar 

  99. Saul A. Kripke. The problem of entailment. Journal of Symbolic Logic,24:324, 1959. Abstract.

    Google Scholar 

  100. Saul A. Kripke. Semantical considerations on modal logic. Acta Philosophica Fennica, 16: 83–94, 1963.

    Google Scholar 

  101. Saul A. Kripke. Semantical analysis of modal logic II: Non-normal modal propositional calculi. In Addison et al., editor, The Theory of Models, pages 206–220. North Holland Publishing Co, 1965.

    Google Scholar 

  102. A. Kron. Deduction theorems for relevant logic. Zeitschrift für Mathematische Logik and Grundlagen der Mathematik, 19: 85–92, 1973.

    Google Scholar 

  103. A. Kron. Deduction theorems for T, E and R reconsidered. Zeitschrift für Mathematische Logik and Grundlagen der Mathematik, 22: 261–264, 1976.

    Google Scholar 

  104. Natasha Kurtonina. Frames and Labels: A Modal Analysis of Categorial Inference. PhD thesis, Institute for Logic, Language and Computation, University of Utrecht, 1995.

    Google Scholar 

  105. Joachim Lambek. The mathematics of sentence structure. American Mathematical Monthly, 65: 154–170, 1958.

    Google Scholar 

  106. Joachim Lambek. On the calculus of syntactic types. In R. Jacobsen, editor, Structure of Language and its Mathematical Aspects, Proceedings of Symposia in Applied Mathematics, XII. American Mathematical Society, 1961.

    Google Scholar 

  107. E. J. Lemmon. Beginning Logic. Nelson, 1965.

    Google Scholar 

  108. E. J. Lemmon. Algebraic semantics for modal logics, I and II. Journal of Symbolic Logic, 31:46–55 and 191–218, 1966.

    Google Scholar 

  109. C. I. Lewis and C. H. Langford. Symbolic Logic. The Century Co, New York and London, 1932.

    Google Scholar 

  110. P. Lincoln, J. Mitchell, A. Scenrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56: 239311, 1992.

    Google Scholar 

  111. L. Lipshitz. The undecidability of the word problems for projective geometries and modular lattices. Transactions of the American Mathematical Society, pages 171–180, 1974.

    Google Scholar 

  112. L. L. Maksimova. O modélâh iscisléniâ E. Algébra i Logika, Séminar, 6:5–20, 1967. ( English title: On Models of the System E).

    Google Scholar 

  113. L. L. Maksimova. An interpolation and separation theorem for the logical systems e and r. Algebra and Logic, 10: 232–241, 1971.

    Google Scholar 

  114. L. L. Maksimova. A semantics for the calculus E of entailment. Bulletin of the section of Logic, 2:18–21, 1973. Published by Polish Academy of Sciences, Institute of Philosophy and Sociology.

    Google Scholar 

  115. Edwin D. Mares and André Fuhrmann. A relevant theory of conditionals. Journal of Philosophical Logic, 24: 645–665, 1995.

    Google Scholar 

  116. Edwin Mares. Semantics for relevance logic with identity. Studia Logica, 51: 1–20, 1992.

    Google Scholar 

  117. Edwin Mares. Relevant logic and the theory of information. Synthese, 109: 345–360, 1997.

    Google Scholar 

  118. E. P. Martin and R. K. Meyer. Solution to the P-W problem. Journal of Symbolic Logic, 47: 869–886, 1982.

    Google Scholar 

  119. J. C. C. McKinsey and A. Tarski. Some theorems about the sentential calculi of Lewis and Heyting. Journal of Symbolic Logic, 13: 1–15, 1948.

    Google Scholar 

  120. M. A. McRobbie and N. D. Belnap Jr. Relevant analytic tableaux. Studia Logica, 38: 187–200, 1979.

    Google Scholar 

  121. Robert K. Meyer and J. Michael Dunn. E, R and ry. Journal of Symbolic Logic, 34: 460–474, 1969.

    Google Scholar 

  122. Robert K. Meyer and H. Leblanc. A semantical completeness result for relevant quantification theories. Journal of Symbolic Logic,35:181, 1970. Abstract.

    Google Scholar 

  123. Robert K. Meyer and Michael A. McRobbie. Firesets and relevant implication. Technical Report 3, Logic Group, RSSS, Australian National University, 1979.

    Google Scholar 

  124. Robert K. Meyer and Richard Routley. Algebraic analysis of entailment. Logique et Analyse, 15: 407–428, 1972.

    Google Scholar 

  125. Robert K. Meyer and Richard Routley. Classical relevant logics I. Studia Logica, 32: 51–66, 1973.

    Google Scholar 

  126. Robert K. Meyer and Richard Routley. Classical relevant logics II. Studia Logica, 33: 183–194, 1973.

    Google Scholar 

  127. Robert K. Meyer and Richard Routley. An undecidable relevant logic. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 19: 289–397, 1973.

    Google Scholar 

  128. Robert K. Meyer and Igor Urbas. Conservative extension in relevant arithmetics. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 32: 45–50, 1986.

    Google Scholar 

  129. Robert K. Meyer, J. Michael Dunn, and H. Leblanc. Completeness of relevant quantification theories. Notre Dame Journal of Formal Logic, 15: 97–121, 1974.

    Google Scholar 

  130. Robert K. Meyer, Richard Routley, and J. Michael Dunn. Curry’s paradox. Analysis,39:124–128, 1979.

    Google Scholar 

  131. Robert K. Meyer, Michael A. McRobbie, and Nuel D. Belnap. Linear analytic tableaux. In Proceedings of the Fourth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, volume 918 of Lecture Notes in Computer Science, 1995.

    Google Scholar 

  132. Robert K. Meyer. Topics in Modal and Many-valued Logic. PhD thesis, University of Pittsburgh, 1966.

    Google Scholar 

  133. Robert K. Meyer. An undecidability result in the theory of relevant implication. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 14: 255262, 1968.

    Google Scholar 

  134. Robert K. Meyer. E and S4. Notre Darne Journal of Formal Logic, 11: 181–199, 1970.

    Google Scholar 

  135. Robert K. Meyer. RI—the bounds of finitude. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 16: 385–387, 1970.

    Google Scholar 

  136. Robert K. Meyer. On coherence in modal logics. Logique et Analyse, 14: 658–668, 1971.

    Google Scholar 

  137. Robert K. Meyer. Intuitionism, entailment, negation. In H. Leblanc, editor, Truth, Syntax and Modality, pages 168–198. North Holland, 1973.

    Google Scholar 

  138. Robert K. Meyer. New axiomatics for relevant logics — I. Journal of Philosophical Logic, 3: 53–86, 1974.

    Google Scholar 

  139. R. K. Meyer. Ackermann, Takeuti and Schnitt; ry for higher-order relevant logics. Bulletin of the Section of Logic, 5: 138–144, 1976.

    Google Scholar 

  140. Robert K. Meyer. Metacompleteness. Notre Dame Journal of Formal Logic, 17: 501–517, 1976.

    Google Scholar 

  141. Robert K. Meyer. Relevant arithmetic. Bulletin of the Section of Logic, 5: 133–137, 1976.

    Google Scholar 

  142. Robert K. Meyer. Why I am not a relevantist. Technical Report 1, Logic Group, RSSS, Australian National University, 1978.

    Google Scholar 

  143. R. K. Meyer. A Boolean-valued semantics for r. Technical Report 4, Logic Group, RSSS, Australian National University, 1979.

    Google Scholar 

  144. Robert K. Meyer. Arithmetic formulated relevantly. Unpublished manuscript. Some of the results appear in Entailment Volume 2 [Anderson et al.,1992], 1979.

    Google Scholar 

  145. Robert K. Meyer. Career induction stops here (and here = 2). Journal of Philosophical Logic, 8: 361–371, 1979.

    Google Scholar 

  146. Robert K. Meyer. Relevantly interpolating in RM. Technical Report 9, Logic Group, RSSS, Australian National University, 1980.

    Google Scholar 

  147. Robert K. Meyer. DE is admissible in ‘true’ relevant arithmetic. Journal of Philosophical Logic, 27: 327–351, 1998.

    Google Scholar 

  148. G. Minc. Cut-elimination theorem in relevant logics. In J. V. Matijasevic and O. A. Silenko, editors, Isslédovanid po konstructivnoj mathematiké i matematiäeskoj logike V,pages 90–97. Izdatél’stvo “Nauka”, 1972. (English translation in “Cut-Elimination Theorem in Relevant Logics” [Minc, 1976]).

    Google Scholar 

  149. G. Minc. Cut-elimination theorem in relevant logics. The Journal of Soviet Mathematics,6:422–428, 1976. (English translation of the original article [Minc, 1972]).

    Google Scholar 

  150. Chris Mortensen. Inconsistent Mathematics. Kluwer Academic Publishers, 1995.

    Google Scholar 

  151. W. T. Parry. Ein axiomensystem für eine neue art von implikation (analytische implication). Ergebnisse eines mathematischen Kolloquiums, 4: 5–6, 1933.

    Google Scholar 

  152. G. Pottinger. On analysing relevance constructively. Studia Logica, 38: 171–185, 1979.

    Google Scholar 

  153. Dag Prawitz. Natural Deduction: A Proof Theoretical Study. Almqvist and Wiksell, Stockholm, 1965.

    Google Scholar 

  154. Graham Priest and Richard Sylvan. Simplified semantics for basic relevant logics. Journal of Philosophical Logic, 21: 217–232, 1992.

    Google Scholar 

  155. Graham Priest. In Contradiction: A Study of the Transconsistent. Martinus Nijhoff, The Hague, 1987.

    Google Scholar 

  156. Graham Priest. Beyond the Limits of Thought. Cambridge University Press, Cambridge, 1995.

    Google Scholar 

  157. W. V. Quine. Three grades of modal involvement. In Proceedings of the XIth International Congress of Philosophy. North Holland, Amsterdam, 1953. Reprinted in The Ways of Paradox, Random House, New York, 1966.

    Google Scholar 

  158. H. Rasiowa. An Algebraic Approach to Non-classical Logics. North Holland, 1974.

    Google Scholar 

  159. Stephen Read. Relevant Logic. Basil Blackwell, Oxford, 1988.

    Google Scholar 

  160. Greg Restall. Simplified semantics for relevant logics (and some of their rivals). Journal of Philosophical Logic, 22: 481–511, 1993.

    Google Scholar 

  161. Greg Restall. A useful substructural logic. Bulletin of the Interest Group in Pure and Applied Logic, 2 (2): 135–146, 1994.

    Google Scholar 

  162. Greg Restall. Display logic and gaggle theory. Reports in Mathematical Logic, 29: 133–146, 1995.

    Google Scholar 

  163. Greg Restall. Information flow and relevant logics. In Jerry Seligman and Dag Westerstahl, editors, Logic, Language and Computation: The 1994 Moraga Proceedings, pages 463–477. CSLI Publications, 1995.

    Google Scholar 

  164. Greg Restall. Displaying and deciding substructural logics 1: Logics with contraposition. Journal of Philosophical Logic, 27: 179–216, 1998.

    Google Scholar 

  165. Greg Restall. Negation in Relevant Logics: How I Stopped Worrying and Learned to Love the Routley Star. In Dov Gabbay and Heinrich Wansing, editors, What is Negation?, volume 13 of Applied Logic Series, pages 53–76. Kluwer Academic Publishers, 1999.

    Google Scholar 

  166. Greg Restall. An Introduction to Substructural Logics. Routledge, 2000.

    Google Scholar 

  167. Richard Routley and Robert K. Meyer. Semantics of entailment. In Hugues Leblanc, editor, Truth Syntax and Modality, pages 194–243. North Holland, 1973. Proceedings of the Temple University Conference on Alternative Semantics.

    Google Scholar 

  168. Richard Routley and Robert K. Meyer. Dialectal logic, classical logic and the consistency of the world. Studies in Soviet Thought, 16: 1–25, 1976.

    Google Scholar 

  169. Richard Routley and Valerie Routley. Semantics of first degree entailment. Nods, 3:335–359, 1972.

    Google Scholar 

  170. Richard Routley, Val Plumwood, Robert K. Meyer, and Ross T. Brady. Relevant Logics and their Rivals. Ridgeview, 1982.

    Google Scholar 

  171. Richard Routley. Ultralogic as universal. Relevance Logic Newsletter, 2:51–89, 1977. Reprinted in Exploring Meinong’s Jungle [Routley, 1980a ].

    Google Scholar 

  172. Richard Routley. Exploring Meinong’s Jungle and Beyond. Philosophy Department, RSSS, Australian National University, 1980. Interim Edition, Departmental Monograph number 3.

    Google Scholar 

  173. Richard Routley. Problems and solutions in the semantics of quantified relevant logics I. In A. I. Arrduda, R. Chuaqui, and N. C. A. da Costa, editors, Proceedings of the Fourth Latin American Symposium on Mathematical Logic, pages 305–340. North Holland, 1980.

    Google Scholar 

  174. Peter Schroeder-Heister and Kosta Dosen, editors. Substructural Logics. Oxford University Press, 1993.

    Google Scholar 

  175. K. Schütte. Ein system des verknüpfenden schliessens. Archiv für Mathematische Logik, 2: 55–67, 1956.

    Google Scholar 

  176. Dana Scott. On engendering an illusion of understanding. Journal of Philosophy, 68: 787–807, 1971.

    Google Scholar 

  177. Moh Shaw-Kwei. The deduction theorems and two new logical systems. Methodos, 2: 56–75, 1950.

    Google Scholar 

  178. John K. Slaney. 3088 varieties: A solution to the Ackermann constant problem. Journal of Symbolic Logic, 50: 487–501, 1985.

    Google Scholar 

  179. John K. Slaney. A general logic. Australasian Journal of Philosophy, 68: 74–88, 1990.

    Google Scholar 

  180. R. M. Smullyan. First-Order Logic. Springer-Verlag, Berlin, 1968. Reprinted by Dover Press, 1995.

    Google Scholar 

  181. M. H. Stone. The theory of representation for Boolean algebras. Transactions of the American Mathematical Society, 40: 37–111, 1936.

    Google Scholar 

  182. P. Suppes. Introduction to Logic. D. Van Nostrand Co, Princeton, 1957.

    Google Scholar 

  183. Tennant, 1994] Neil Tennant. The transmission of truth and the transitivity of deduction. In Dov Gabbay, editor What is a Logical System?volume 4 of Studies in Logic and Computation,pages 161–177. Oxford University Press, Oxford, 1994.

    Google Scholar 

  184. Paul Thistlewaite, Michael McRobbie, and Robert K. Meyer. Automated Theorem Proving in Non-Classical Logics. Wiley, New York, 1988.

    Google Scholar 

  185. M. Tokarz. Essays in Matrix Semantics of Relevant Logics. The Polish Academy of Science, Warsaw, 1980.

    Google Scholar 

  186. A. S. Troelstra. Lectures on Linear Logic. CSL] Publications, 1992. [Urquhart, 1972a ] Alasdair Urquhart. The completeness of weak implication. Theorie, 37: 274–282, 1972.

    Google Scholar 

  187. Alasdair Urquhart. A general theory of implication. Journal of Symbolic Logic, 37: 443, 1972.

    Google Scholar 

  188. Alasdair Urquhart. Semantics for relevant logics. Journal of Symbolic Logic, 37: 159–169, 1972.

    Google Scholar 

  189. Alasdair Urquhart. The Semantics of Entailment. PhD thesis, University of Pittsburgh, 1972.

    Google Scholar 

  190. Alasdair Urquhart. Relevant implication and projective geometry. Logique et Analyse, 26: 345–357, 1983.

    Google Scholar 

  191. Alasdair Urquhart. The undecidability of entailment and relevant implication. Journal of Symbolic Logic, 49: 1059–1073, 1984.

    Google Scholar 

  192. Alasdair Urquhart. The complexity of decision procedures in relevance logic. In J. Michael Dunn and Anil Gupta, editors, Truth or Consequences, pages 7795. Kluwer, 1990.

    Google Scholar 

  193. Alasdair Urquhart. Failure of interpolation in relevant logics. Journal of Philosophical Logic, 22: 449–479, 1993.

    Google Scholar 

  194. Alasdair Urquhart. The complexity of decision procedures in relevance logic ii. Available from the author, University of Toronto, 1997.

    Google Scholar 

  195. Bas van Fraassen. Facts and tautological entailments. Journal of Philosophy, 66:477–487, 1969. Reprinted in Entailment Volume 1 [Anderson and Belnap, 1975 ].

    Google Scholar 

  196. Bas van Fraassen. Extension, intension and comprehension. In M. Munitz, editor, Logic and Ontology, pages 101–103. New York University Press, New York, 1973.

    Google Scholar 

  197. Heinrich Wansing. The Logic of Information Structures. Number 681 in Lecture Notes in Artificial Intelligence. Springer-Verlag, 1993.

    Google Scholar 

  198. R. G. Wolf. Are relevant logics deviant. Philosophia, 7: 327–340, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indiana University, USA

    J. Michael Dunn

  2. Macquarie University, Australia

    Greg Restall

Authors
  1. J. Michael Dunn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Greg Restall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. King’s College, London, UK

    Dov M. Gabbay

  2. Centrum für Informations- und Sprachverarbeitung, Ludwig-Maximilians-Universität München, Germany

    F. Guenthner

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Dunn, J.M., Restall, G. (2002). Relevance Logic. In: Gabbay, D.M., Guenthner, F. (eds) Handbook of Philosophical Logic. Handbook of Philosophical Logic, vol 6. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0460-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0460-1_1

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-6004-4

  • Online ISBN: 978-94-017-0460-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation