Abstract
This paper presents an overview of the pioneering contributions of Larisa Maksimova to relevance logics. She is one of the first researchers who set out to methodically study systems of relevance logics, initially, focusing on Ackermann’s \(\varPi '\) of “Rigorous Implication,” and then extending her work to Anderson and Belnap’s systems E of Entailment and R of Relevant Implication, and other related logics. Not only did she develop an algebraic semantics for E, but also we find that a semantic definition of entailment via a ternary accessibility relation appears — the very first time — in an abstract by her.
Similar content being viewed by others
Notes
- 1.
See Hollings (2014).
- 2.
- 3.
See Anderson and Belnap (1975, Sect. 26.2 and 29.2).
- 4.
- 5.
We should point out that Maksimova (1967a) is missing from the references in Anderson and Belnap (1975) and the content of the mentioned section is attributed to Maksimova (1967b), which does not contain those results or their proofs — as should become obvious from our account of the content of the latter paper.
- 6.
She seems to use the term “rigorous implication” not only to denote Ackermann’s \(\varPi '\) calculus, but other closely related calculi too, each of which avoids the paradoxes of material implication. The “S” in “SE” may stand for “strenge” or for “(sub)system.”
- 7.
Maksimova is careful to distinguish between the components of the language of the logic SE and the particles of a model — as she did earlier too. We continue to re-use the same symbols for the connectives in order to shorten our presentation.
- 8.
Some earlier work of Maksimova (e.g., her 1967c) concerned connections between quasi-ordered sets and closure operators.
- 9.
- 10.
See Dunn (1986, Sect. 4.3–4.4) for more on De Morgan lattices and their representation including the fact that Białynicki-Birula and Rasiowa (1957) first originated the use of an involution in the representation of De Morgan lattices. The latter are the algebraic counterparts of first-degree entailments. (Cf. Lemma 3.2.10.).
- 11.
- 12.
For a detailed algebraic explanation of this point, see Anderson and Belnap (1975, Sect. 28.2).
- 13.
- 14.
See Anderson and Belnap (1975, pp. 351–352).
- 15.
References
Anderson, A. R. (1963). Some open problems concerning the system E of entailment. Acta Philosophica Fennica, 16, 9–18.
Anderson, A. R. (1971). Review: L. L. Maksimova, on models of the calculus E. Journal of Symbolic Logic, 36(3), 521.
Anderson, A. R., & Belnap, N. D. (1975). Entailment: The logic of relevance and necessity (Vol. I). Princeton: Princeton University Press.
Anderson, A. R., Belnap, N. D., & Dunn, J. M. (1992). Entailment: The logic of relevance and necessity (Vol. II). Princeton: Princeton University Press.
Belnap, N. D. (1960). EQ and the first order functional calculus. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 6, 217–218.
Belnap, N. D. (1967). Intensional models for first degree formulas. Journal of Symbolic Logic, 32, 1–22.
Białynicki-Birula, A., & Rasiowa, H. (1957). On the representation of quasi-Boolean algebras. Bulletin de l’Académie Polonaise des Sciences, 5, 259–261.
Bimbó, K. (2007a). Functorial duality for ortholattices and De Morgan lattices. Logica Universalis, 1, 311–333.
Bimbó, K. (2007b). Relevance logics. In D. Jacquette (Ed.), Philosophy of logic, D. Gabbay, P. Thagard & J. Woods, (Eds.), Handbook of the philosophy of science (Vol. 5, pp. 723–789). Amsterdam: Elsevier (North-Holland).
Bimbó, K. (2009). Dual gaggle semantics for entailment. Notre Dame Journal of Formal Logic, 50, 23–41.
Bimbó, K. (2015). Proof theory: Sequent calculi and related formalisms. Discrete Mathematics and its Applications. Boca Raton: CRC Press.
Bimbó, K., & Dunn, J. M. (2008). Generalized Galois logics. Relational semantics of nonclassical logical calculi. CSLI Lecture Notes, (Vol. 188). Stanford: CSLI Publications.
Bimbó, K., & Dunn, J. M. (2012). New consecution calculi for \(R_{\rightarrow }^{t}\). Notre Dame Journal of Formal Logic, 53, 491–509.
Bimbó, K., & Dunn, J. M. (2013). On the decidability of implicational ticket entailment. Journal of Symbolic Logic, 78, 214–236.
Donchenko, V. V. (1963). Nekotorye voprosy, svyazannye s problemoǐ rasresheniya dlya ischisleniya strogoǐ implikatsii, Problemy Logiki, Akademiya Nauk SSSR, Moscow, pp.18–24. [Some questions concerning the decision problem for Ackermann’s calculus of rigorous implication].
Dunn, J. M. (1966). The Algebra of Intensional Logics, Ph.D. thesis, University of Pittsburgh, Ann Arbor (UMI).
Dunn, J. M. (1973). A ‘Gentzen system’ for positive relevant implication, (abstract). Journal of Symbolic Logic, 38, 356–357.
Dunn, J. M. (1986). Relevance logic and entailment. In D. Gabbay & F. Guenthner (Eds.), Handbook of philosophical logic (1st edn., Vol. 3, pp. 117–224). Dordrecht: D. Reidel.
Dunn, J. M. (1993). Partial gaggles applied to logics with restricted structural rules. In K. Došen & P. Schroeder-Heister (Eds.), Substructural logics (pp. 63–108). Oxford: Clarendon.
Dunn, J. M. (2001). A representation of relation algebras using Routley-Meyer frames. In C. A. Anderson & M. Zelëny (Eds.), Logic, meaning and computation. Essays in memory of Alonzo Church (pp. 77–108). Dordrecht: Kluwer.
Dunn, J. M. (2008). Information in computer science. In P. Adriaans & J. van Benthem (Eds.), Philosophy of information, D. M. Gabbay, P. Thagard & J. Woods (Eds.), Handbook of the philosophy of science (Vol. 8, pp. 581–608). Amsterdam: Elsevier.
Hollings, C. (2014). Mathematics across the iron curtain: A history of the algebraic theory of semigroups. History of mathematics (Vol. 41). Providence: American Mathematical Society.
Maksimova, L. L. (1964). O sisteme aksiom ischisleniya strogoǐ implikatsii. Algebra i logika, 3(5), 59–68. [On the system of axioms of the calculus of rigorous implication].
Maksimova, L. L. (1966). Formal’nye vyvody v ischislenii strogoǐ implikatsii. Algebra i logika, 5(6), 33–39. [Formal deductions in the calculus of rigorous implication].
Maksimova, L. L. (1967a). Nekotorye voprosy ischisleniya Akkermana. Doklady AN SSSR, 175(6), 1222–1224. [Translation: Some problems of the Ackermann calculus, Soviet Mathematics, 8 (1967), pp. 997–999.].
Maksimova, L. L. (1967b). O modelyakh ischisleniya \(E\). Algebra i logika, 6(6), 5–20. [On models of the calculus \(E\)].
Maksimova, L. L. (1967c). Topologicheskie prostranstva i kvaziuporyadochennye mnozhestva. Algebra i logika, 6(4), 51–59. [Topological spaces and quasi-ordered sets].
Maksimova, L. L. (1968a). Logicheskie ischisleniya strogoǐ implikatsii, Ph.D. thesis, SO AN SSSR, Novosibirsk. [Logical calculi of rigorous implication].
Maksimova, L. L. (1968b). Ob ischislenii strogoǐ implikatsii. Algebra i logika, 7(2), 55–76. [On a calculus of rigorous implication].
Maksimova, L. L. (1969). Interpretatsiya sistem so strogoǐ implikatsieǐ, 10th All-Union Algebraic Colloquium (Abstracts), Novosibirsk, p. 113. [An interpretation of systems with rigorous implication].
Maksimova, L. L. (1970). O E-teoriyakh. Algebra i logika, 8(5), 530–538. [On the theories of E].
Maksimova, L. L. (1971). Interpretatsiya i teoremy otdeleniya dlya ischisleniǐ \(E\) i \(R\). Algebra i logika, 10(4), 376–392. [Interpretations and separation theorems for the calculi \(E\) and \(R\)].
Maksimova, L. L. (1973a). A semantics for the system E of entailment. Bulletin of the Section of Logic of the Polish Academy of Sciences, 2, 18–21.
Maksimova, L. L. (1973b). Struktury s implikatsieǐ. Algebra i logika, 12(4), 445–467. [Structures with implication].
Maksimova, L. L. (1976). Printsip razdeleniya peremennykh v propozitsional’nykh logikakh. Algebra i logika, 15(2), 168–184. [The principle of variable segregation in propositional logics].
Maksimova, L. L. (1989). Relevance principles and formal deducibility. In J. Norman & R. Sylvan (Eds.), Directions in relevant logic (Vol. 1, pp. 95–97). Reason and Argument. Dordrecht: Kluwer.
Meyer, R. K., & Dunn, J. M. (1969). E, R and \(\gamma \). Journal of Symbolic Logic, 34, 460–474. (Reprinted in Anderson, A. R., & Belnap, N. D. (1975). Entailment: The logic of relevance and necessity (Vol. 1, pp. 300–314). Princeton: Princeton University Press, Sect. 25.2.
Meyer, R. K., Dunn, J. M., & Leblanc, H. (1974). Completeness of relevant quantification theories. Notre Dame Journal of Formal Logic, 15(1), 97–121.
Priestley, H. A. (1970). Representation of distributive lattices by means of ordered Stone spaces. Bulletin of the London Mathematical Society, 2, 186–190.
Routley, R., & Meyer, R. K. (1972). The semantics of entailment - III. Journal of Philosophical Logic, 1, 192–208.
Routley, R., & Routley, V. (1972). The semantics of first degree entailment. Noûs, 6, 335–359.
Stone, M. H. (1936). The theory of representations for Boolean algebras. Transactions of the American Mathematical Society, 40, 37–111.
Urquhart, A. (1984). The undecidability of entailment and relevant implication. Journal of Symbolic Logic, 49, 1059–1073.
Urquhart, A. (1996). Duality for algebras of relevant logics. Studia Logica, 56, 263–276.
Urquhart, A. (2007). Four variables suffice. Australasian Journal of Logic, 5, 66–73.
Acknowledgements
We would like to thank Larisa Maksimova for providing us with e-copies of some of her publications that were otherwise inaccessible to us. We are thankful to Sergeǐ Odintsov for his help in this matter, and to the anonymous referees for their comments.
Parts of this paper belong to our larger project concerning the relational semantics of intensional logics, which is supported by an Insight Grant (IG #435–2014–0127), awarded by the Social Sciences and Humanities Research Council of Canada.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Bimbó, K., Dunn, J.M. (2018). Larisa Maksimova’s Early Contributions to Relevance Logic. In: Odintsov, S. (eds) Larisa Maksimova on Implication, Interpolation, and Definability. Outstanding Contributions to Logic, vol 15. Springer, Cham. https://doi.org/10.1007/978-3-319-69917-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-69917-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69916-5
Online ISBN: 978-3-319-69917-2
eBook Packages: Religion and PhilosophyPhilosophy and Religion (R0)