×

A family of neighborhood contingency logics. (English) Zbl 1444.03052

A contingency logic is a kind of modal logic to study the notion of contingency (or noncontingency) by formalizing it as a unary logical operator. In this paper, as seems to be rather common in the literature, the noncontingency denoted by \(\Delta\) is employed as the primitive and interpreted in terms of the necessity as for any formula \(\varphi\) it is noncontingent that \(\varphi\) iff it is necessary that \(\varphi\) or it is necessary that not \(\varphi\). Thus any formula \(\varphi\) with \(\Delta\) can be translated into a usual modal formula \(\varphi^*\) by the replacement, which then gives rise to the noncontingency logic \(L\Delta\) of given modal logic \(L\) by considering the inverse image of the translation. Since the interpretation also allows us to develop a semantical analysis of \(\Delta\) in a natural way, the semantical characterization of \(L\Delta\) follows from that of \(L\) straightforwardly. For example, \(K\Delta\) is the noncontingency logic characterized by all Kripke frames (under the interpretation of \(\Delta\) given in the obvious way) where \(K\) is the least normal modal logic as usual. However, the axiomatization of \(L\Delta\) does not follow from that of \(L\) thus immediately because it is not possible to characterize the necessity by \(\Delta\) in general. So the axiomatization is one of the problems of (non)contingency logics which have been studied by the author, Cresswell, Humberstone, Kuhn and others, where Humberstone suggested to modify the definition of accessibility relation in the canonical Kripke model construction (due to the so-called Henkin method for the normal modal logic). In fact, the axiomatization of \(K\Delta\) has been established by S. T. Kuhn [Notre Dame J. Formal Logic 36, No. 2, 230–234 (1995; Zbl 0833.03005)] according to a similar canonical Kripke model construction, while the definition of accessibility is slightly different in its appearance from that suggested by I. L. Humberstone [Notre Dame J. Formal Logic 36, No. 2, 214–229 (1995; Zbl 0833.03004)]. Thus the study has been developed mainly in relation to normal modal logics. But Z. Bakhtiari et al. [Lect. Notes Comput. Sci. 10119, 48–63 (2017; Zbl 1485.03063)] proposed the axiomatization problem of noncontingency logic induced by a modal logic weaker than \(K\), in particular, those of \(E\Delta\) and \(M\Delta\) where \(E (M)\) is the least regular (monotone) modal logic. In this paper, the author gives the answer to these two cases as well as to some others weaker than \(K\Delta\). The logics taken up in this paper are first characterized by means of neighbourhood semantics according to four additional conditions on neighbourhood system, which are roughly the complimentation condition characteristic to the noncontingency and the superset condition (i.e., closure under supersets) to build up the normality in conjunction with other two conditions as usual. So, a simple calculation gives rise to 16 combinations, among which the author shows the axiomatization for 10 cases including the above mentioned two. The principal issue is the completeness proof according to the canonical neighbourhood model construction, in which for the cases without the superset condition the construction can be carried out exactly in the similar way as usual for regular modal logic but for the cases with the superset condition such a straight definition does not work and is to be modified by a similar idea as that of Kuhn [loc. cit.] introduced in the Kripke semantics. Then, the author analyzes the definitions of Kuhn [loc. cit.] and Humberstone [loc. cit.] for more details and shows that they are actually the same even in the generalized setting of neighbourhood semantics. Among the 6 cases for which the axiomatization problem has been left open, two couples are shown to be the same (exactly, \(MZ\Delta = RZ\Delta\) and \(EMNZ\Delta = KZ\Delta\)) with simple axiomatizations respectively as a matter of fact, even though they are dealt with as different (cf. Figure 1). There are some gaps in the argument of 3 of Remark 24.

MSC:

03B45 Modal logic (including the logic of norms)
PDF BibTeX XML Cite
Full Text: DOI arXiv Euclid

References:

[1] Bakhtiari (Bakhtiarinoodeh), Z., H. van Ditmarsch, and H. H. Hansen, “Neighbourhood contingency bisimulation,” pp. 48-63 in Logic and Its Applications, edited by S. Ghosh and S. Prasad, vol. 10119 of Lecture Notes in Computer Science, Springer, Berlin, 2017. · Zbl 1485.03063
[2] Bakhtiari (Bakhtiarinoodeh), Z., “The dynamics of incomplete and inconsistent information: Applications of logic, algebra and coalgebra,” Ph.D. dissertation, Université de Lorraine, Nancy, 2017.
[3] Chellas, B. F., Modal Logic: An Introduction, Cambridge University Press, Cambridge, 1980. · Zbl 0431.03009
[4] Cresswell, M. J., “Necessity and contingency,” Studia Logica, vol. 47 (1988), pp. 145-49. · Zbl 0666.03015
[5] Fan, J., “Neighborhood contingency logic: A new perspective,” Studies in Logic, vol. 11 (2018), pp. 37-55.
[6] Fan, J., and H. van Ditmarsch, “Neighborhood contingency logic,” pp. 88-99 in Logic and Its Applications, edited by M. Banerjee and S. N. Krishna, vol. 8923 of Lecture Notes in Computer Science, Springer, Heidelberg, 2015. · Zbl 1304.03049
[7] Fan, J., Y. Wang, and H. van Ditmarsch, “Almost necessary,” pp. 178-96 in Advances in Modal Logic, edited by R. Goré, B. Kooi, and A. Kurucz, vol. 10 of Advances in Modal Logic, College Publications, London, 2014. · Zbl 1385.03017
[8] Fan, J., Y. Wang, and H. van Ditmarsch, “Contingency and knowing whether,” Review of Symbolic Logic, vol. 8 (2015), pp. 75-107. · Zbl 1375.03023
[9] Humberstone, L., “The logic of non-contingency,” Notre Dame Journal of Formal Logic, vol. 36 (1995), pp. 214-29. · Zbl 0833.03004
[10] Humberstone, L., “The modal logic of agreement and noncontingency,” Notre Dame Journal of Formal Logic, vol. 43 (2002), pp. 95-127. · Zbl 1046.03008
[11] Humberstone, L., “Zolin and Pizzi: Defining necessity from noncontingency,” Erkenntnis, vol. 78 (2013), pp. 1275-1302. · Zbl 1303.03023
[12] Kuhn, S. T., “Minimal non-contingency logic,” Notre Dame Journal of Formal Logic, vol. 36 (1995), pp. 230-34. · Zbl 0833.03005
[13] Montague, R., “Universal grammar,” Theoria, vol. 36 (1970), pp. 373-98. · Zbl 0243.02002
[14] Montgomery, H., and R. Routley, “Contingency and non-contingency bases for normal modal logics,” Logique et Analyse (Nouvelle Série), vol. 9 (1966), pp. 318-28. · Zbl 0294.02008
[15] Scott, D., “Advice on modal logic,” pp. 143-73 in Philosophical Problems in Logic: Some Recent Developments, edited by K. Lambert, Reidel, Dordrecht, 1970. · Zbl 0295.02013
[16] Steinsvold, C., “A note on logics of ignorance and borders,” Notre Dame Journal of Formal Logic, vol. 49 (2008), pp. 385-92. · Zbl 1180.03017
[17] van der Hoek, W., and A. Lomuscio, “A logic for ignorance,” Electronic Notes in Theoretical Computer Science, vol. 85 (2004), pp. 117-33. · Zbl 1270.03042
[18] Zolin, E., “Completeness and definability in the logic of noncontingency,” Notre Dame Journal of Formal Logic, vol. 40 (1999), pp. 533-47. · Zbl 0989.03019
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.