×

Ternary relations and relevant semantics. (English) Zbl 1060.03039

This is a largely expository paper on the family of relevant logics. Meyer gives some history and also shows that all these relevant logics can be motivated by the properties of a ternary relation \(R\), where \(RXYZ\) is \(X\circ Y \subseteq Z\) and \[ X\circ Y=\{ B: \exists A(A\to B\in X \text{ and }A\in Y)\}. \] The “worlds” \(X, Y\ldots \) over which such binary and ternary relations usually range in semantics, are here “demythologized” as theories. Theories are sets of formulas subject to certain truth conditions and may represent (relevant) logics. These theories can be seen as the unions of the types of combinators. In the case of some theories the simple types of some combinators are sufficient. In these cases the theory is in fact a model of the corresponding combinatory logic, where application is interpreted as fusion \((o)\). Meyer’s “Key to the Universe” is the fact that \(B\wedge T\), a theory based on intersection types, models SK (i.e. full) combinatory logic. The following illustrates the key to the universe syntactically: We list two combinators, their “fusion fact” (i.e. their reduction rule) and their “implication fact” (i.e. their type): \[ \begin{alignedat}{3} &S &\qquad ABC&\leq AC(BC) &\qquad A\to (B\to C)&\leq (A\to B)\to (A\to C)\\ W&B &\qquad AB&\leq A(AB) &\qquad (B\to C)&\wedge (A\to B) \leq A\to C. \end{alignedat} \] If \(L\) is any logic extending \(B[\to, \wedge , 0]\), then a fusion fact is a theorem scheme of \(L\) iff the corresponding implication fact is a theorem scheme.

MSC:

03B47 Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)
03B40 Combinatory logic and lambda calculus
08A02 Relational systems, laws of composition
03-02 Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Ackermann, W., Begründung einer strengen Implikation, J. Symbolic Logic, 21, 113-128 (1956) · Zbl 0072.00106
[2] A.R. Anderson, N.D. Belnap Jr. Entailment I, Princeton University Press, Princeton, 1975.; A.R. Anderson, N.D. Belnap Jr. Entailment I, Princeton University Press, Princeton, 1975.
[3] A.R. Anderson, N.D. Belnap Jr., J.M. Dunn, Entailment II, Princeton University Press, Princeton, 1992.; A.R. Anderson, N.D. Belnap Jr., J.M. Dunn, Entailment II, Princeton University Press, Princeton, 1992.
[4] Barendregt, H.; Coppo, M.; Dezani-Ciancaglini, M., A filter lambda model and the completeness of type assignment, J. Symbolic Logic, 48, 931-940 (1983) · Zbl 0545.03004
[5] R.T. Brady (Ed.), Relevant Logics and Their Rivals II, Aldershot Publ. Ltd., Aldershot, UK; also Burlington, VT, 2003.; R.T. Brady (Ed.), Relevant Logics and Their Rivals II, Aldershot Publ. Ltd., Aldershot, UK; also Burlington, VT, 2003.
[6] Church, A., The Calculi of Lambda-Conversion (1941), Princeton University Press: Princeton University Press Princeton · JFM 67.0041.01
[7] Church, A., The weak theory of implication, (Menne, A.; Wilhelmy, A.; Angsil, H., Kontrolliertes Denken, Untersuchungen zum Logikkalkül und zur Logik der Einzelwissenschaften (1951), Kommisions-Verlag Karl Alber: Kommisions-Verlag Karl Alber Munich), 22-37
[8] Curry, H. B., Foundations of Mathematical Logic (1963), McGraw-Hill: McGraw-Hill New York · Zbl 0163.24209
[9] H.B. Curry, R. Feys, Combinatory logic, Vol. I, North-Holland, Amsterdam.; H.B. Curry, R. Feys, Combinatory logic, Vol. I, North-Holland, Amsterdam. · Zbl 0175.27601
[10] Dezani-Ciancaglini, M.; Meyer, R. K.; Motohama, Y., The semantics of entailment omega, Notre Dame J. Formal Logic, 43, 3, 129-145 (2002) · Zbl 1042.03019
[11] J.M. Dunn, The algebra of intensional logics, Ph.D. thesis, University of Pittsburgh, 1966 (largely incorporated as a Dunn principal contribution in [2]; J.M. Dunn, The algebra of intensional logics, Ph.D. thesis, University of Pittsburgh, 1966 (largely incorporated as a Dunn principal contribution in [2]
[12] Dunn, J. M., A ‘Gentzen system’ for positive relevant implication, J. Symbolic Logic, 38, 356-357 (1974)
[13] Dunn, J. M.; Hardegree, G. M., Algebraic methods in philosophical logic (2001), Oxford University Press: Oxford University Press Oxford · Zbl 1014.03002
[14] Fine, K., Models for entailment, J. Philoso. Logic, 3, 347-372 (1974), (incorporated as a Fine principal contribution in [3]) · Zbl 0296.02013
[15] Girard, J.-Y., Linear Logic, Theoret. Comput. Sci., 50, 1-101 (1987)
[16] Kripke, S., Semantical analysis of modal logic—I, Z. Math. Logik Grundlag. Math., 9, 67-96 (1963) · Zbl 0118.01305
[17] Lambek, J., The mathematics of sentence structure, Amer. Math. Monthly, 65, 154-170 (1958) · Zbl 0080.00702
[18] Lewis, D., Logic for equivocators, Nous, 16, 431-441 (1982) · Zbl 1366.03090
[19] E.P. Martin, The P-W problem, Ph.D. Thesis, Australian National University, Canberra, 1978; E.P. Martin, R.K. Meyer, Solution to the P-W problem, J. Symbolic Logic 47 (1982) 869-886 (and Martin’s contribution to [3]; E.P. Martin, The P-W problem, Ph.D. Thesis, Australian National University, Canberra, 1978; E.P. Martin, R.K. Meyer, Solution to the P-W problem, J. Symbolic Logic 47 (1982) 869-886 (and Martin’s contribution to [3] · Zbl 0498.03011
[20] Meyer, R. K., A farewell to entailment, (Dorn, G.; Weingartner, P., Foundations of logic and linguistics (1985), Plenum: Plenum New York, London), 577-636 · Zbl 0624.03003
[21] R.K. Meyer, Types and the Boolean system \(CB\) http://arp.anu.edu.au/ftp/techreports/1995; R.K. Meyer, Types and the Boolean system \(CB\) http://arp.anu.edu.au/ftp/techreports/1995
[22] R.K. Meyer, M.W. Bunder, L. Powers, Implementing the ‘fool’s model’ of combinatory logic. J. Automat. Reason. 7, 597-630.; R.K. Meyer, M.W. Bunder, L. Powers, Implementing the ‘fool’s model’ of combinatory logic. J. Automat. Reason. 7, 597-630. · Zbl 0749.03007
[23] R.K. Meyer, Y. Motohama, V. Bono, Truth translations of basic relevant logics, paper presented to the Leblanc memorial meeting of the Society for Exact Philosophy, Montreal, 2001.; R.K. Meyer, Y. Motohama, V. Bono, Truth translations of basic relevant logics, paper presented to the Leblanc memorial meeting of the Society for Exact Philosophy, Montreal, 2001.
[24] Meyer, R. K.; Routley, R., Algebraic analysis of relevant logics I, Logique Anal. (N.S.), 15, 407-428 (1972) · Zbl 0336.02020
[25] Meyer, R. K.; Routley, R., Classical relevant logics II, Stud. Logica, 33, 183-194 (1973) · Zbl 0316.02030
[26] Mints, G., Cut-elimination theorem in relevant logics, J. Soviet Math., 6, 422-428 (1976), (English translation of Russian article, 1972) · Zbl 0379.02011
[27] L. Powers, Private communication, 1969 (Powers published these results in On P-W and Latest on a logic problem, Relevance Logic Newslett. 1 (1976) 131-142 and 143-172).; L. Powers, Private communication, 1969 (Powers published these results in On P-W and Latest on a logic problem, Relevance Logic Newslett. 1 (1976) 131-142 and 143-172).
[28] Restall, G., An Introduction to Substructural Logics (2000), Routledge: Routledge London · Zbl 1028.03018
[29] Ronchi della Rocca, S.; Venneri, B., Principal type schemes for an extended type theory, Theoret. Comput. Sci., 28, 151-169 (1984) · Zbl 0535.03007
[30] Routley, R.; Meyer, R. K., The semantics of entailment III, J. Philoso. Logic, 1, 192-208 (1972) · Zbl 0317.02019
[31] Routley, R.; Meyer, R. K., The semantics of entailment (I), (Leblanc, H., Truth, Syntax and Modality (1973), North-Holland: North-Holland Amsterdam), 194-243
[32] Routley, R.; Meyer, R. K.; Plumwood, V.; Brady, R. T., Relevant Logics and Their Rivals I (1982), Ridgeview: Ridgeview Atascadero, CA · Zbl 0579.03011
[33] Urquhart, A., Semantics for Relevant Logics, J. Symbolic Logic, 37, 159-169 (1972) · Zbl 0245.02028
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.