Skip to main content

Relevance Logic and Entailment

  • Chapter
Book cover Handbook of Philosophical Logic

Part of the book series: Synthese Library ((SYLI,volume 166))

Abstract

Note carefully that the title of this piece is not ‘A Survey of Relevance Logic’. Such a project would be impossible given the development of the field and even the space limitations of this Handbook. For example Anderson and Belnap’s [1975] book Entailment: The Logic of Relevance and Necessity, volume 1 runs over 500 pages, and is their summary of just ‘half’ of the work done by them and their co-workers up to about the early 70s.1

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ackermann, W.: 1956, ‘Begrundung einer strengen Implikation’, J. Symbolic Logic 21, 113–128.

    Google Scholar 

  • Anderson, A. R.: 1960, ‘Entailment shorn of modality’ (abstract), J. Symbolic Logic 25, 388.

    Google Scholar 

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

    Google Scholar 

  • Anderson, A. R. and Belnap, N. D. Jr.: 1959a, ‘Modalities in Ackermann’s “rigorous implication”,’ J. Symbolic Logic 24, 107–111.

    Article  Google Scholar 

  • Anderson, A. R. and Belnap, N. D. Jr.: 1959b, ‘A simple treatment of truth functions’, J. Symbolic Logic 24, 301–302.

    Article  Google Scholar 

  • Anderson, A. R. and Belnap, N. D. Jr.: 1959c, ‘A simple proof of Gödel’s completeness theorem’ (abstract), J. Symbolic Logic 24, 320–321.

    Google Scholar 

  • Anderson, A. R. and Belnap, N. D. Jr.: 1961, ‘Enthymemes’, J. Philosophy 58, 713–723.

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Anderson, A. R. and Belnap, N. D. Jr.: 1975, Entailment: The Logic of Relevance and Necessity, Vol. 1, Princeton University Press, Princeton.

    Google Scholar 

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

    Article  Google Scholar 

  • Belnap, N. D. Jr.: 1960a, ‘EQ and the first order functional calculus’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 6, 217–218.

    Article  Google Scholar 

  • Belnap, N. D. Jr.: 1960b, ‘A formal analysis of entailment’, Technical Report No. 7, Contract No. SAR/Nonr. 609 (16), Office of Naval Research, New Haven.

    Google Scholar 

  • Belnap, N. D. Jr.: 1960c, ‘Entailment and relevance’, J. Symbolic Logic 25, 144–146.

    Article  Google Scholar 

  • Belnap, N. D. Jr.: 1960d, ‘First degree formulas’ (abstract), J. Symbolic Logic 25, 388–389.

    Google Scholar 

  • Belnap, N. D. Jr.: 1962, ‘Tonk, plonk and plink’, Analysis 22, 130–134.

    Article  Google Scholar 

  • Belnap, N. D. Jr.: 1967a, ‘Intensional models for first degree formulas’, J. Symbolic Logic 32, 1–22.

    Article  Google Scholar 

  • Belnap, N. D. Jr.: 1967b, ‘Special cases of the decision problem for entailment and relevant implication’ (abstract), J. Symbolic Logic 32,431–432.

    Google Scholar 

  • Belnap, N. D. Jr.: 1977a, ‘A useful four-valued logic’, in J. M. Dunn and G. Epstein (eds.), Modem Uses of Multiple-Valued Logic, D. Reidel Publishing Company, Dordrecht and Boston.

    Google Scholar 

  • Belnap, N. D. Jr.: 1977b, ‘How a computer should think’, in G. Ryle (ed.), Contemporary Aspects of Philosophy, Oriel Press.

    Google Scholar 

  • Belnap, N. D. Jr. and Dunn, J. M.: 1981, ‘Entailment and the disjunctive syllogism’, in G. Flistad and G. H. von Wright (eds.) Philosophy of Language/Philosophical Logic, Martinus Nijhoff, pp. 337–366.

    Google Scholar 

  • Belnap, N. D. Jr., Gupta, A., and Dunn, J. M.: 1980, ‘A consecution calculus for positive relevant implication with necessity’, J. Philosophical Logic 9, 343–362.

    Article  Google Scholar 

  • Belnap, N. D. Jr. and Spencer, J. H.: 1966. ‘Intensionally complemented distributive lattices’ Portugaliae Mathematica 25, 99–104.

    Google Scholar 

  • Belnap, N. D. Jr. and Wallace, J. R.: 1961, ‘A decision procedure for the system Ej of entailment with negation’, Technical Report No. 11, Contract No. SAR/609 (16), Office of Naval Research, New Haven. Also published in Zeitschrift für mathematische Logic und Grundlagen der Mathematik 11(1965), 277–289.

    Google Scholar 

  • Bialynicki-Birula, A. and Rasiowa, H.: 1957, ‘On the representation of quasi-Boolean algebras’, Bulletin de l’académie polonaise des sciences 5, 259–261.

    Google Scholar 

  • Burgess, J. P.: 1981 ‘Relevance: a fallacy?’, Notre Dame J. Formal Logic 22, 97–104.

    Article  Google Scholar 

  • Castaneda, H. N.: 1975, Thinking and Doing: The Philosophical Foundations of Institutions, D. Reidel, Dordrecht.

    Google Scholar 

  • Charlewood, G. W.: 1978, Representations of Semilattice Relevance Logic, Ph.D. Dissertation, University of Toronto.

    Google Scholar 

  • Charlewood, G. W.: 1981, ‘An axiomatic version of positive semi-lattice relevance logic’, J. Symbolic Logic 46, 233–239.

    Article  Google Scholar 

  • Church, A.: 1951, ‘The weak theory of implication’, Menne-Wilhelmy-Angsil (eds.) Kontrolliertes Denken, Untersuchungen zum Logikkalkül und der Logik der Einzel- wissenschaften, Kommissions-verlag Karl Alber, Munich, 1951, pp. 22–37.

    Google Scholar 

  • Clark, M.: 1980, ‘The equivalence of tautological and “strict” entailment: proof of an amended conjecture of Lewy’s’, J. Philosophical Logic 9, 9–15.

    Article  Google Scholar 

  • Copeland, B. J.: 1979, ‘On when a semantics is not a semantics: some reasons for dis¬liking the Routley-Meyer semantics for relevance logic’, J. Philosophical Logic 8, 399–413.

    Article  Google Scholar 

  • Curry, H. B.: 1950, A Theory of Formal Deducibility, Notre Dame Mathematical Lectures No. 6, Notre Dame University Press.

    Google Scholar 

  • Dipert, R. R.: 1978, Development and Crisis in Late Boolean Logic; The Deductive Logics ofPeirce, Jevons and Schröder, Ph.D. Dissertation, Indiana University.

    Google Scholar 

  • Dunn, J. M.: 1966, The Algebra of Intensional Logics, Ph.D. Dissertation, University of Pittsburgh.

    Google Scholar 

  • Dunn, J. M.: 1967, ‘The effective equivalence of certain propositions about de Morgan lattices’ (abstract), J. Symbolic Logic 32, 433–434.

    Google Scholar 

  • Dunn, J. M.: 1969, ‘Natural language versus formal language’, Presented at the Joint APA-ASL Symposium, New York, Dec. 27, 1969.

    Google Scholar 

  • Dunn, J. M.: 1970, ‘Algebraic completeness results for R-mingle and its extensions’, J. Symbolic Logic 35, 1–13.

    Article  Google Scholar 

  • Dunn. J. M.: 1971, ‘An intuitive semantics for first degree relevant implications’ (abstract), J. Symbolic Logic 36, 362–363.

    Google Scholar 

  • Dunn, J. M.: 1973, ‘A ‘Gentzen system’ for positive relevant implication’ (abstract), J. Symbolic Logic 38, 356–357.

    Google Scholar 

  • Dunn, J. M.: 1976a, ‘Intuitive semantics for first-degree entailments and coupled trees’, Philosophical Studies 29, 149–168.

    Article  Google Scholar 

  • Dunn, J. M.: 1976b, ‘A Kripke-style semantics for R-mingle using a binary accessibility relation’, Studia Logica 35, 163–172.

    Article  Google Scholar 

  • Dunn, J. M.: 1976c, ‘Quantification and RM’, Studia Logica 35, 315–322.

    Article  Google Scholar 

  • Dunn, J. M.: 1976d, ‘A variation on the binary semantics for RM’, Relevance Logic Newsletter 1, 56–67.

    Google Scholar 

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

    Article  Google Scholar 

  • Dunn, J. M.: 1979b, lR-Mingle and beneath: extensions of the Routley-Meyer semantics for R’, Notre Dame J. Formal Logic 20, 369–376.

    Google Scholar 

  • Dunn, J. M.: 1980a, ‘Relevant Robinson’s arithmetic’, Studia Logica 38, 407–418.

    Article  Google Scholar 

  • Dunn, J. M.: 1980b, ‘A sieve for entailments’, J. Philosophical Logic 9, 41–57.

    Article  Google Scholar 

  • Dunn, J. M.: 198+, ‘A relational representation theorem for De Morgan lattices’, Notre Dame J. Formal Logic.

    Google Scholar 

  • Dunn, J. M. and Belnap, N. D. Jr.: 1968, ‘Homomorphisms of intensionally comple¬mented distributive lattices’, Math. Annalen 176, 28–38.

    Article  Google Scholar 

  • Dunn, J. M. and Meyer, R. K.: 1971, ‘Algebraic completeness results for Dummett’s LC and its extensions’, Zeitschrift far mathematische Logik und Grundlagen der Mathematik 17, 225–230.

    Article  Google Scholar 

  • Dunn, J. M. and Meyer, R. K.: 198+, ‘Gentzen’s cut and Ackermann’s ?’.

    Google Scholar 

  • Feys, R. and L2019; (translation of Gentzen 1934), Paris.

    Google Scholar 

  • Fine, K.: 1974, ‘Models for entailment’, J. Philosophical Logic 3, 347–372.

    Article  Google Scholar 

  • Fine, K.: 1976a, ‘Completeness for the S5 analogue of E I ’, J. Symbolic Logic 41, 559– 560.

    Google Scholar 

  • Fine, K.: 1976b, ‘Completeness for the semilattice semantics with disjunction and conjunction’, J. Symbolic Logic 41, 560.

    Google Scholar 

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

    Google Scholar 

  • Gabbay, D. M.: 1974, ‘On second order intuitionistic propositional calculus with full comprehension’, Archiv für mathematische Logik und Grundlagenforschung 16, 177–186.

    Article  Google Scholar 

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

    Book  Google Scholar 

  • Gentzen, G.: 1934, ‘Untersuchiingen iiber das logische Schliessen’, Math. Zeitschrift 39, 176–210 and 405–431. Translated in Szabo (ed.), Collected Papers of Gerhard Gentzen, North-Holland Publishing Co., 1969, pp. 68–131.

    Google Scholar 

  • Grice, H. P.: 1975, ‘Logic and conversation’, in P. Cole and J. L. Morgan (eds.) Syntax and SemanticsVol. 3: Speech Acts, Academic Press, New York, pp. 41–58.

    Google Scholar 

  • Haack, S.: 1974, Deviant Logic: Some Philosophical Issues, Cambridge University Press.

    Google Scholar 

  • Harrop, R.: 1965, ‘Some structure results for propositional calculi’, J. Symbolic Logic 30, 271–292.

    Article  Google Scholar 

  • Kalman, J. A.: 1958, ‘Lattices with involution’, Trans. Amer. Math. Soc. 87, 485–491.

    Article  Google Scholar 

  • Kripke, S.: 1959a, ‘A completeness theorem in modal logic’, J. Symbolic Logic 24, 1–15.

    Article  Google Scholar 

  • Kripke, S.: 1959b, ‘The problem of entailment’ (abstract), J. Symbolic Logic 24, 324.

    Google Scholar 

  • Kripke, S.: 1963, ‘Semantical analysis of modal logic I: normal modal propositional calculi’, Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9, 67–96.

    Article  Google Scholar 

  • Kripke, S.: 1965, ‘Semantical analysis of modal logic II: non-normal modal propositional calculi’, in Addison et al. (eds.), The Theory of Models, North-Holland Publishing Co., pp. 206–220.

    Google Scholar 

  • Kron, A.: 1973, ‘Deduction theorems for relevant logic’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 19, 85–92.

    Article  Google Scholar 

  • Kron, A.: 1976, ‘Deduction theorems for T, E and R reconsidered’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 22, 261–264.

    Article  Google Scholar 

  • Lemmon, E. J.: 1965, Beginning Logic, Nelson.

    Google Scholar 

  • Lemmon, E. J.: 1966, ‘Algebraic semantics for modal logics, I and II’, J. Symbolic Logic 31,46–65 and 191–218.

    Google Scholar 

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

    Google Scholar 

  • Maksimova, L. L.: 1967, ‘O modéláh iscisléniá E (On Models of the System E)’, Algébra i logika, Seminar 6, 5–20.

    Google Scholar 

  • Maksimova, L. L.: 1971, ‘An interpolation and separation theorems for the logical systems Eand R’, Algebra and Logic 10, 232–241.

    Article  Google Scholar 

  • Maksimova, L. L.: 1973, ‘A semantics for the calculus Eof entailment’, Bulletin of the Section of Logic 2, 18–21 ( Published by Polish Academy of Sciences, Institute of Philosophy and Sociologically).

    Google Scholar 

  • Martin, E. P. and Meyer, R. K.: 198+, ‘Solution to the P-W problem’, J. Symbolic Logic.

    Google Scholar 

  • McCall, S.: 1964, ‘A new variety of implication’ (abstract), J. Symbolic Logic 29,151–152.

    Google Scholar 

  • McKinsey, J. C. C. and Tarski, A.: 1944, ‘The algebra of topology’, Annals Math. 45, No. 1, 141–191.

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Meyer, R. K.: 1966, Topics in Modal and Many-valued Logic, Ph.D. dissertation, University of Pittsburgh.

    Google Scholar 

  • Meyer, R. K.: 1968, ‘An undecidability result in the theory of relevant implication’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 14, 255–262.

    Article  Google Scholar 

  • Meyer, R.K.: 1970a, ‘Eand S4’, Notre Dame J. Formal Logic 11, 181–199.

    Article  Google Scholar 

  • Meyer, R. K.: 1970b, ‘Rj - the Bounds of Finitude’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 16, 385–387.

    Article  Google Scholar 

  • Meyer, R. K.: 1971a, ‘Entailment’, J. Philosophy 68, 808–818.

    Article  Google Scholar 

  • Meyer, R. K.: 1971b, ‘On coherence in modal logics’, Logique et Analyse n.s. 14, 658–668.

    Google Scholar 

  • Meyer, R. K.: 1973, ‘Institutionism, entailment, and negation’, in H. Leblanc (ed.), Truth, Syntax and Modality, North-Holland Publishing Co., pp. 168–198.

    Chapter  Google Scholar 

  • Meyer, R. K.: 1974, ‘New axiomatics for relevant logics I’, J. Philosophical Logic 3, 53–86.

    Article  Google Scholar 

  • Meyer, R. K.: 1976a, ‘Relevant arithmetic’, Bulletin of the Section of Logic 5, 133–137.

    Google Scholar 

  • Meyer, R. K.: 1976b, ‘Ackermann, Takeuti, and Schnitt; γ for higher-order relevant logics’, Bulletin of the Section of Logic 5, 138–144.

    Google Scholar 

  • Meyer, R. K.: 1976c, ‘A general Gentzen system for implicational calculi’, Relevance Logic Newsletter 1, 189–201.

    Google Scholar 

  • Meyer, R. K.: 1976d, ‘Metacompleteness’, Notre Dame J. of Formal Logic 17, 501–517.

    Google Scholar 

  • Meyer, R. K.: 1978, ‘Why I am not a relevantist’, Research Paper No. 1, Logic Group, R.S.S.S., Australian National University.

    Google Scholar 

  • Meyer, R. K.: 1979a, ‘A Boolean-valued semantics for R’, Research Paper No. 4, Logic Group, R.S.S.S., Australian National University.

    Google Scholar 

  • Meyer, R. K.: 1979b, ‘Career induction stops here (and here = 2)’, J. Philosophical Logic 8, 361–371.

    Article  Google Scholar 

  • Meyer, R. K.: 1980, ‘Relevantly interpolating in RM’, Research Paper No. 9, Logic Group, R.S.S.S., Australian National University.

    Google Scholar 

  • Meyer, R. K.: 198+a. K.: 198+a, ‘The consistency of arithmetic’ (typescript, 1975 ).

    Google Scholar 

  • Meyer, R. K.: 198+b, ‘Arithmetic formulated relavantly’.

    Google Scholar 

  • Meyer, R. K.: 198+c. K.: 198+c, ‘Improved decision procedures for pure relevant logics’, (typescript, 1973 ).

    Google Scholar 

  • Meyer, R. K.: 198+d. K.: 198+d, ‘Entailment is strict implication’ (typescript, 1976 ).

    Google Scholar 

  • Meyer, R. K.: 198+e. K.: 198+e, ‘The relevant theory of propositions is undecidable’ (typescript, 1978 ).

    Google Scholar 

  • Meyer, R. K. and Dunn, J. M.: 1969, ‘E,Rand ⋁’, J. Symbolic Logic 34, 460–474.

    Article  Google Scholar 

  • Meyer, R. K., Dunn, J. M. and Leblanc, H.: 1974, ‘Completeness of relevant quantification theories’, Notre Dame J. Formal Logic 15, 97–121.

    Article  Google Scholar 

  • Meyer, R. K. and Leblanc, H.: 1970, ‘A semantical completeness result for relevant quantification theories’ (abstract), J. Symbolic Logic 35,181.

    Google Scholar 

  • Meyer, R. K. and Leblanc, H.: 1972, ‘Matters of separation’, Notre Dame J. Formal Logic 13, 229–236.

    Article  Google Scholar 

  • Meyer, R. K. and McRobbie, M. A.: 1–79, ‘Firesets and relevant implication’, Research Paper No. 3, Logic Group, R.S.S.S., Australian National University.

    Google Scholar 

  • Meyer, R. K. and Routley, R.: 1972, ‘Algebraic analysis of entailment’, Logique et Analyse, n.s. 15,407–428.

    Google Scholar 

  • Meyer, R. K. and Routley, R.: 1973a, ‘An undecidable relevant logic’, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 19, 289–397.

    Article  Google Scholar 

  • Meyer, R. K. and Routley, R.: 1973b, ‘Classical relevance logics I’, Studia Logica 32, 51–66.

    Article  Google Scholar 

  • Meyer, R. K. and Routley, R.: 1974, ‘Classical relevance logics II’, Studia Logica 33, 183–194.

    Article  Google Scholar 

  • Mine, G. E.: 1972, ‘Cut-elimination theorem in relevant logics’, J. Sov. Math. 6(1976), 422–428.

    Google Scholar 

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

    Google Scholar 

  • Parry, W. T.: 1933, ‘Ein Axiomensystem fur eine neue Art von Implikation (Analytische Implikation)’, Ergebnisse eines mathematischen Kolloquiums 4, 5–6.

    Google Scholar 

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

    Article  Google Scholar 

  • Prawitz, D.: 1965, Natural Deduction: A Proof-theoretical Study, Almqvist and Wiksell, Stockholm.

    Google Scholar 

  • Prawitz, D.: 1968, ‘Hauptsatz for higher order logic’, J. Symbolic Logic 33, 452–457.

    Article  Google Scholar 

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

    Google Scholar 

  • Rasiowa, H.: 1974, An Algebraic Approach to Non-classical Logics, North-Holland Publishing Co.

    Google Scholar 

  • Routley, R.: 1977, ‘Ultralogic as universal’, Relevance Logic Newsletter 2, 51–89.

    Google Scholar 

  • Routley, R. and Meyer, R. K.: 1972, ‘The semantics of entailment, II and III’, J. Philo-sophical Logic 1, 53–73 and 192–208.

    Google Scholar 

  • Routley, R. and Meyer, R. K.: 1973, ‘The semantics of entailment, I’, in H. Leblanc (ed.), Truth, Syntax and Semantics, North-Holland, Amsterdam, 1973, pp. 194–243.

    Google Scholar 

  • Routley, R. and Meyer, R. K.: 1976, ‘Dialectal logic, Classical logic and the consistency of the world’, Studies in Soviet Thought 16, 1–25.

    Article  Google Scholar 

  • Routley, R. and Meyer, R. K.: 198+, Relevance Logic and its Rivals.

    Google Scholar 

  • Routley, R. and Routley, V.: 1972, ‘Semantics of first degree entailment’, Noûs 6, 335–359.

    Article  Google Scholar 

  • Scott, D.: 1971, ‘On engendering an illusion of understanding’, J. Philosophy 68, 787– 807.

    Google Scholar 

  • Schiitte, K.: 1956, ‘Ein System des verkniipfenden Schliessens’, Archiv für mathematische Logik und Grundlagenforschung 2, 55–67.

    Google Scholar 

  • Smullyan, R. M.: 1968, First-Order Logic, Springer-Verlag, Berlin.

    Book  Google Scholar 

  • Stone, M. H.: 1936, ‘The theory of representation for Boolean algebras’, Trans. Amer. Math. Soc. 40, 37–111.

    Google Scholar 

  • Stone, M. H.: 1936, ‘The theory of representations of distributive lattices and Brou-werian logics’, Casopis pro pestovam matematiky a fysiky 67,1–25.

    Google Scholar 

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

    Google Scholar 

  • Tokarz, M.: 1979a, ‘Deduction theorems for RM and its extensions’, Studia Logica 38, 105–111.

    Article  Google Scholar 

  • Tokarz, M.: 1979b, ‘The existence of matrices strongly adequate for E, Rand their fragments’, Studia Logica 38, 75–84.

    Article  Google Scholar 

  • Tokarz, M.: 1980, Essays in Matrix Semantics of Relevant Logics, The Polish Academy of Sciences, Warsaw.

    Google Scholar 

  • Urquhart, A.: 1972a, ‘Semantics for relevant logics’, J. Symbolic Logic 37, 159–169.

    Article  Google Scholar 

  • Urquhart, A.: 1972b, ‘A general theory of implication’, J. Symbolic Logic 37, 443.

    Article  Google Scholar 

  • Urquhart, A.: 1972c, ‘The completeness of weak implication’, Theoria 37, 274–282.

    Article  Google Scholar 

  • Urquhart, A.: 1972d, The Semantics of Entailment, Ph.D. Dissertation, University of Pittsburgh.

    Google Scholar 

  • Van Fraassen, B.: 1969, ‘Facts and tautological entailments’, J. Philosophy 66, 477– 487.

    Google Scholar 

  • Van Fraassen, B.: 1973, ‘Extension, intension, and comprehension’, M. Munitz (ed.), Logic and Ontology, New York University Press, New York, pp. 101’103;

    Google Scholar 

  • Wolf, R. G.: 1978, ‘Are relevant logics deviant?’, Philosophia 7, 327–340.

    Article  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Dunn, J.M. (1986). Relevance Logic and Entailment. In: Gabbay, D., Guenthner, F. (eds) Handbook of Philosophical Logic. Synthese Library, vol 166. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5203-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-5203-4_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-8801-5

  • Online ISBN: 978-94-009-5203-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics