Skip to main content
Log in

Topic Transparency and Variable Sharing in Weak Relevant Logics

  • Original Research
  • Published:
Erkenntnis Aims and scope Submit manuscript

Abstract

In this paper, we examine a number of relevant logics’ variable sharing properties from the perspective of theories of topic or subject-matter. We take cues from Franz Berto’s recent work on topic to show an alignment between families of variable sharing properties and responses to the topic transparency of relevant implication and negation. We then introduce and defend novel variable sharing properties stronger than strong depth relevance—which we call cn-relevance and lossless cn-relevance—showing that the properties are satisfied by the weak relevant logics \({\textbf{B}}\) and \({{\textbf{B}}}{{\textbf{M}}}\), respectively. We argue that such properties address a sort of semantic lossiness of strong depth relevance.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. The applicability of two-component approaches to topic in mainstream relevant logics has recently seen an extraordinarily compelling defense and model theory in Tedder (2023).

  2. It is worth mentioning how Meyer, Dunn, and Leblanc aptly refer to the variable sharing property as the “crudest but most memorable result” (Meyer et al., 1974) concerning relevance with respect to the logic \({\textbf{R}}\).

  3. The theory of topic is still in its relative infancy especially with respect to its ontology. We try to remain somewhat agnostic about the particular model of topic—favoring instead less formal intuitions—but note that many, if not all, of the historical approaches reviewed in e.g. Yablo (2014) cohere with these informal intuitions.

  4. To be sure, we do not offer the foregoing as, say, an exegesis of Brady’s goals but rather as a possible explanation. We should note, however, that there is undoubtedly a topic-theoretic reading of Brady’s interpretation of his model theory of contents.

  5. As noted in e.g. Logan (2022), although Belnap’s initial proof of variable sharing from Belnap (1960) does not acknowledge the stronger form of variable sharing, the 1960 proof is reproduced in Anderson and Belnap (1975) as a proof of the stronger property.

  6. Note that this characterization coincides with the definition of antecedent and consequent parts of a sentence, i.e., that B appears positively (resp., negatively) in A corresponds to its being an antecedent part (resp., consequent part) of A.

  7. For a clear discussion of the distinctions between these two expansions of \({\textbf{R}}\), see Mares and Goldblatt’s (2006).

  8. This is closely related to a problem in Meyer’s relevant arithmetic \({\textbf{R}}^{\sharp }\), described by Brady as the that in \({\textbf{R}}^{\sharp }\), “\(m=n\rightarrow m' = n'\) [is a theorem] which has the natural numbers m and n in common, leads to \(0=0\rightarrow 100=100\), where the two numbers involved can be as far apart as you like.” (Brady, 2006, p. 11) That this theorem “smacks of irrelevance” (as Dunn says in Dunn (1987)) involves a similar acknowledgement that the overlap of terms—in this case two instances of 0 followed by sequences of \('\)—need not ensure relevance. Estrada-González and Tapia-Navarro’s (2021) takes up this matter in more detail.

  9. For a broader range of examples, one can consult the discussion of intensionality and subject-matter in Ferguson (2023).

  10. This priority is not universal—Dov Gabbay considers several subtle means through which consequents can exert a similar role in Gabbay (1972)—but the priority is extremely entrenched.

  11. It’s worthwhile to note that there is in the literature another way in which depth relevance has been ‘expanded’; namely in the exploration of depth relevant logics that aren’t typically included in the class of relevant logics. This project has been taken up in e.g. Robles and Méndez (2014).

  12. As a reviewer points out, one can extract from this proof a proof of the claim that weak-enough relevant logics are depth relevant in the sense of Brady (1984). In fact, the proof in Logan (2022) (which was corrected in Logan (2023)) is of exactly this form, though for a slightly broader class of logics.

  13. We thank both reviewers of this paper for drawing our attention to this assumption.

  14. It’s interesting that the same modification of \(\sigma \)—that is, the change from \(\sigma \) to \(\sigma ^{c/nc}\)—does the job in both cases.

References

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

    Google Scholar 

  • Angell, R. B. (1977). Three systems of first degree entailment. Journal of Symbolic Logic, 42(1), 147.

    Google Scholar 

  • Angell, R.B. (1989). Deducibility, entailment and analytic containment. In: Norman, J., Sylvan, R. (eds.) Directions in Relevant Logic. Reason and Argument, pp. 119–143. Kluwer Academic Publishers, Boston, MA

  • Beall, J., Brady, R. T., Hazen, A. P., Priest, G., & Restall, G. (2006). Relevant restricted quantification. Journal of Philosophical Logic, 35(6), 587–598.

    Article  Google Scholar 

  • Belnap, N. D., Jr. (1960). Entailment and relevance. The Journal of Symbolic Logic, 25(2), 144–146.

    Article  Google Scholar 

  • Berto, F. (2015). A modality called ‘negation’. Mind, 124(495), 761–793.

    Article  Google Scholar 

  • Berto, F. (2022). Topics of Thought. Oxford: Oxford University Press.

    Book  Google Scholar 

  • Berto, F., & Jago, M. (2019). Impossible Worlds. Oxford: Oxford University Press.

    Book  Google Scholar 

  • Brady, R. T. (1984). Depth relevance of some paraconsistent logics. Studia Logica, 43(1–2), 63–73.

    Article  Google Scholar 

  • Brady, R. T. (2006). Universal Logic. Stanford: CSLI Publications.

    Google Scholar 

  • Brady, R. T. (2008). Negation in metacomplete relevant logics. Logique et Analyse, 51(204), 331–354.

    Google Scholar 

  • Dunn, J. M. (1987). Relevant predication 1: The formal theory. Journal of Philosophical Logic, 16(4), 347–381.

    Article  Google Scholar 

  • Estrada-González, L., & Tapia-Navarro, M. E. (2021). A smack of irrelevance in inconsistent mathematics? Australasian Journal of Logic, 18(5), 503–523.

    Article  Google Scholar 

  • Ferguson, T. M. (2018). Parity, relevance, and gentle explosiveness in the context of Sylvan’s mate function. Australasian Journal of Logic, 15(2), 381–406.

    Article  Google Scholar 

  • Ferguson, T. M. (2023). A topic-theoretic perspective on variable-sharing (from the black sheep of the family). In I. Sedlár, S. Standefer, & A. Tedder (Eds.), New Directions in Relevant Logic. Cham: Springer.

    Google Scholar 

  • Ferguson, T. M. (2023). Subject-matter and intensional operators I: Conditional-agnostic analytic implication. Philosophical Studies, 180(7), 1849–1879.

    Article  Google Scholar 

  • Fine, K. (2016). Angellic content. Journal of Philosophical Logic, 45(2), 199–226.

    Article  Google Scholar 

  • Fuhrmann, A. (1990). Models for relevant modal logics. Studia Logica, 49(4), 501–514.

    Article  Google Scholar 

  • Gabbay, D. (1972). A general theory of the conditional in terms of a ternary operator. Theoria, 38(3), 97–104.

    Article  Google Scholar 

  • Hawke, P. (2018). Theories of aboutness. Australasian Journal of Philosophy, 96(4), 697–723.

    Article  Google Scholar 

  • Humberstone, L. (2011). The Connectives. Cambridge, MA: MIT Press.

    Book  Google Scholar 

  • Jago, M. (2020). Truthmaker semantics for relevant logic. Journal of Philosophical Logic, 49, 681–702.

    Article  Google Scholar 

  • Kratzer, A. (1991). Conditionals. In A. Stechow & D. Wunderlich (Eds.), Semantics: An International Handbook of Contemporary Research (pp. 651–656). Berlin: Walter de Gruyter.

    Google Scholar 

  • Logan, S. A. (2021). Strong depth relevance. Australasian Journal of Logic, 18(6), 645–656.

    Article  Google Scholar 

  • Logan, S. A. (2022). Depth relevance and hyperformalism. Journal of Philosophical Logic, 51(4), 721–737.

    Article  Google Scholar 

  • Logan, S. A. (2023). Correction to: Depth relevance and hyperformalism. Journal of Philosophical Logic, 52(4), 1235.

    Article  Google Scholar 

  • Mares, E. (2022). Relevance logic. In: Zalta, E.N., Nodelman, U. (eds.) The Stanford Encyclopedia of Philosophy, Fall 2022 edn. https://plato.stanford.edu/archives/fall2022/entries/logic-relevance

  • Mares, E., & Goldblatt, R. (2006). An alternative semantics for quantified relevant logics. Journal of Symbolic Logic, 71(1), 163–187.

    Article  Google Scholar 

  • Meyer, R. K., Dunn, J. M., & Leblanc, H. (1974). Completeness of relevant quantification theories. Notre Dame Journal of Formal Logic, 15(1), 97–121.

    Google Scholar 

  • Priest, G., & Sylvan, R. (1992). Simplified semantics for basic relevant logics. Journal of Philosophical Logic, 21(2), 217–232.

    Article  Google Scholar 

  • Restall, G. (1998). Displaying and deciding substructural logics 1: Logics with contraposition. Journal of Philosophical Logic, 27(2), 179–216.

    Article  Google Scholar 

  • Robles, G., & Méndez, J. M. (2012). A general characterization of the variable-sharing property by means of logical matrices. Notre Dame Journal of Formal Logic, 53(2), 223–244.

    Google Scholar 

  • Robles, G., & Méndez, J. M. (2014). Generalizing the depth relevance condition: Deep relevant logics not included in R-Mingle. Notre Dame Journal of Formal Logic, 55(1), 107–127.

    Article  Google Scholar 

  • Routley, R., Plumwood, V., Meyer, R. K., & Brady, R. (1982). Relevant Logics and Their Rivals (Vol. 1). Atascadero, CA: Ridgeview Publishing.

    Google Scholar 

  • Tedder, A. (2023). Relevant logics and logics of topic. Unpublished manuscript

  • Tennant, N. (2017). Core Logic. Oxford: Oxford University Press.

    Book  Google Scholar 

  • Yablo, S. (2014). Aboutness. Princeton: Princeton University Press.

    Book  Google Scholar 

Download references

Acknowledgements

The input of two reviewers for this journal was incredibly useful; we appreciate their remarks. Thomas Ferguson’s contributions to this paper were written with the support of the MetaMuSo project (Czech Science Foundation project GA22-01137 S).

Funding

This work has received funding by Czech Science Foundation, grant no. 22-01137 S. There are no competing interests.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thomas Macaulay Ferguson.

Ethics declarations

Conflict of interest

The authors have not disclosed any competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ferguson, T.M., Logan, S.A. Topic Transparency and Variable Sharing in Weak Relevant Logics. Erkenn (2023). https://doi.org/10.1007/s10670-023-00748-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10670-023-00748-6

Keywords

Navigation