Hostname: page-component-669899f699-qzcqf Total loading time: 0 Render date: 2025-04-25T18:49:18.806Z Has data issue: false hasContentIssue false
  • English
  • Français

$\gamma $-ADMISSIBILITY IN FIRST-ORDER RELEVANT LOGICS: PROOF USING NORMAL MODELS IN THE MARES–GOLDBLATT SETTING

Part of: General logic

Published online by Cambridge University Press:  12 December 2024

NICHOLAS FERENZ Open the ORCID record for NICHOLAS FERENZ [Opens in a new window]  and
THOMAS MACAULAY FERGUSON Open the ORCID record for THOMAS MACAULAY FERGUSON [Opens in a new window]
NICHOLAS FERENZ*
Affiliation:
CENTER OF PHILOSOPHY, SCHOOL OF ARTS AND HUMANITIES UNIVERSITY OF LISBON CIDADE UNIVERSITÁRIA, ALAMEDA DA UNIVERSIDADE 1649-004, LISBON PORTUGAL
THOMAS MACAULAY FERGUSON
Affiliation:
DEPARTMENT OF COGNITIVE SCIENCE RENSSELAER POLYTECHNIC INSTITUTE 110 8TH STREET, TROY, NY 12180 USA E-mail: [email protected]
*
E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

For relevant logics, the admissibility of the rule of proof $\gamma $ has played a significant historical role in the development of relevant logics. For first-order logics, however, there have been only a handful of $\gamma $-admissibility proofs for a select few logics. Here we show that, for each logic L of a wide range of propositional relevant logics for which excluded middle is valid (with fusion and the Ackermann truth constant), the first-order extensions QL and LQ admit $\gamma $. Specifically, these are particular “conventionally normal” extensions of the logic $\mathbf {G}^{g,d}$, which is the least propositional relevant logic (with the usual relational semantics) that admits $\gamma $ by the method of normal models. We also note the circumstances in which our results apply to logics without fusion and the Ackermann truth constant.

Keywords

relevant logicgamma admissibilityfirst-order relevant logic

MSC classification

Primary: 03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)
Type
Research Article
Information
The Review of Symbolic Logic , First View , pp. 1 - 22
Check for updates
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Ackermann, W. (1956). Begründung einer Strengen Implikation. The Journal of Symbolic Logic, 21, 113–128.Google Scholar
Bimbó, K. (2007). Relevance logics. In Jacquette, D., editor, Philosophy of Logic, vol 5. of Handbook of the Philosophy of Science (Gabbay, D., Thagard, P. and Woods, J., eds.). North Holland: Elsevier, pp. 723–789.Google Scholar
Brady, R. (1983). The Non-Triviality of Dialectical Set Theory. In Priest, G., Routley, R., and Norman, J., editors, Paraconsistent Logics: Essays in the Inconsistent. Munich: Philosophia Verlag, pp. 437–471.Google Scholar
Brady, R. (1988). A content semantics for quantified relevant logics I. Studia Logica, 47, 111–127.Google Scholar
Brady, R. (1989). A content semantics for quantified relevant logics II. Studia Logica, 48, 243–257.Google Scholar
Dunn, J. M., & Restall, G. (2002). Relevance logic. In Gabbay, D. M., and Guenthner, F., editors. Handbook of Philosophical Logic (second edition). Netherlands: Springer, pp. 1–128.Google Scholar
Ferenz, N. (2022). Conditional FDE logics. In Bimbó, K, editor. Relevance Logics and Other Tools for Reasoning. Essays in Honour of J. Michael Dunn, London: College Publications, pp. 182–214.Google Scholar
Ferenz, N. (2023). Quantified modal relevant logics. Review of Symbolic Logic, 16, 210–240.Google Scholar
Ferenz, N., & Ferguson, T. M. (2024). $\gamma$ -admissibility for Mares’ varying domain QR . In Sedlár, I., editor, The Logica Yearbook 2023, London: College Publications. To appear.Google Scholar
Ferenz, N., & Tedder, A. (2023). Neighbourhood semantics for modal relevant logics. Journal of Philosophical Logic, 52, 145–181.Google Scholar
Fine, K. (1988). Semantics for quantified relevance logics. Journal of Philosophical Logic, 17, 22–59.Google Scholar
Fine, K. (1989). Incompleteness for quantified relevant logics. In Norman, J. & Sylvan, R., editors. Directions in Relevant Logic. New York: Kluwer Academic Publishers, pp. 205–225, Reprinted in Entailment vol. 2, §52, Anderson, Belnap, and Dunn, 1992.Google Scholar
Friedman, H., & Meyer, R. K. (1992). Whither relevant arithmetic? Journal of Symbolic Logic, 57(3), 824–831.Google Scholar
Humberstone, L. (2011). The Connectives. Cambridge: MA.Google Scholar
Kripke, S. (2022). A proof of gamma. In Bimbó, K., editor. Relevance Logics and Other Tools for Reasoning . Essays in Honor of J. Michael Dunn, London: College Publications, pp. 261–265.Google Scholar
Mares, E., & Goldblatt, R. (2006). An alternative semantics for quantified relevant logic. The Journal of Symbolic Logic, 71, 163–187.Google Scholar
Mares, E., & Meyer, R. K. (1992). The admissibility of $\gamma$ in R4 . Notre Dame Journal of Formal Logic, 33, 197–206.Google Scholar
Mares, E. D. (2009). General information in relevant logic. Synthese, 167(2), 421–440.Google Scholar
Meyer, R. K. (1976). Metacompleteness. Notre Dame Journal of Formal Logic, 17, 501–516.Google Scholar
Meyer, R. K., & Dunn, J. M. (1969). E, R, and $\gamma$ . Journal of Symbolic Logic, 34, 460–474.Google Scholar
Meyer, R. K., Dunn, J. M., & Leblanc, H. (1974). Completeness of relevant quantification theories. Notre Dame Journal of Formal logic, 15, 97–121.Google Scholar
Meyer, R. K., Giambrone, S., & Brady, R. (1984). Where gamma fails. Studia Logica, 43, 247–256.Google Scholar
Pudlák, P. (1998). The lengths of proofs. In Buss, S. R., editor. Handbook of Proof Theory. Amsterdam: North Holland, pp. 547–637.Google Scholar
Raftery, J. G., & Świrydowicz, K. (2016). Structural completeness in relevance logics. Studia Logica, 104, 381–387.Google Scholar
Routley, R., & Meyer, R. K. (1972). The semantics of entailment (2). The Journal of Philosophical logic, 1, 53–73.Google Scholar
Routley, R., & Meyer, R. K. (1973). The semantics of entailment (1). In Leblanc, H., editor. Truth, Syntax, and Modality. Amsterdam: North-Holland, pp. 199–243.Google Scholar
Routley, R., Plumwood, V., Meyer, R. K., & Brady, R. T. (1982). Relevant Logics and Their Rivals: Part 1 The basic Philosophical and Semantical Theory. Ridgeview: Atascadero, CA.Google Scholar
Seki, T. (2003). General frames for relevant modal logics. Notre Dame Journal of Formal Logic, 44, 93–109.Google Scholar
Seki, T. (2011a). The $\gamma$ -admissibility of relevant modal logics I—the method of normal models. Studia Logica, 97, 199–231.Google Scholar
Seki, T. (2011b). The $\gamma$ -admissibility of relevant modal logics II—the method using metavaluations. Studia Logica, 97, 351–383.Google Scholar
Seki, T. (2012). An algebraic proof of the admissibility of $\gamma$ in relevant modal logics. Studia Logica, 100, 1149–1174.Google Scholar
Slaney, J. K. (1987). Reduced models for relevant logics without WI. Notre Dame Journal of Formal Logic, 28(3), 395–407.Google Scholar
Smiley, T. (1973). Relative necessity. Journal of Symbolic Logic, 28, 113–134.Google Scholar
Tedder, A., & Ferenz, N. (2022). Neighbourhood semantics for quantified relevant logics. Journal of Philosophical Logic, 51, 457–484.Google Scholar
Urquhart, A. (2016). The story of $\gamma$ . In Bimbo, K., editor, J. Michael Dunn on Information Based Logics (Outstanding Contributions to Logic, vol. 8). Cham: Springer, pp. 93–106.Google Scholar
Weiss, Y. (2020). Cut and gamma I: Propositional and constant domain R . The Review of Symbolic Logic, 13, 887–909.Google Scholar