Skip to main content
Log in

Sequential Reflexive Logics with Noncontingency Operator

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

Hilbert systems L and sequential calculi [L ] for the versions of logics L= T,S4,B,S5, and Grz stated in a language with the single modal noncontingency operator ⊳ A=□A∨□¬ A are constructed. It is proved that cut is not eliminable in the calculi [L ], but we can restrict ourselves to analytic cut preserving the subformula property. Thus the calculi [T ], [S4 ], [S5 ] ([Grz ], respectively) satisfy the (weak, respectively) subformula property; for [B 2 ], this question remains open. For the noncontingency logics in question, the Craig interpolation property is established.

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

REFERENCES

  1. A. P. Brogan, “Aristotle's logic of statements about contingency,” Mind, 76 (1967), 49-81.

    Google Scholar 

  2. H. Montgomery and R. Routley, “Contingency and noncontingency bases for normal modal logics,” Logique et Analyse, 9 (1966), 318-328.

    Google Scholar 

  3. H. Montgomery and R. Routley, “Noncontingency axioms for S4 and S5,” Logique et Analyse, 11 (1968), 422-424.

    Google Scholar 

  4. H. Montgomery and R. Routley, “Modalities in a sequence of normal noncontingency modal systems,” Logique et Analyse, 12 (1969), 225-227.

    Google Scholar 

  5. C. Mortensen, “A sequence of normal modal systems with noncontingency bases,” Logique et Analyse, 19 (1976), 341-344.

    Google Scholar 

  6. M. J. Cresswell, “Necessity and contingency,” Studia Logica, 47 (1988), 145-149.

    Google Scholar 

  7. I. L. Humberstone, “The logic of noncontingency,” Notre Dame J. Formal Logic, 36 (1995), no. 2, 214-229.

    Google Scholar 

  8. S. T. Kuhn, “Minimal noncontingency logic,” Notre Dame J. Formal Logic, 36 (1995), no. 2, 230-234.

    Google Scholar 

  9. E. Zolin, “Epistemic noncontingency logic,” Notre Dame J. Formal Logic, 40 (1999), no. 4, 533-547.

    Google Scholar 

  10. E. Zolin, “Sequential logic of arithmetical noncontingency,” Vestnik Moskov. Univ. Ser. I Mat. Mekh. [Moscow Univ. Math. Bull.] (2001), no. 6, 43-48.

  11. G. E. Mints, “Lewis's systems and system T (1965-1973),” in: R. Feys, Modal Logic [Russian translation], Nauka, Moscow, 1974, pp. 423-509. The book by R. Feys Modal Logic was originally published by Gauthier-Villars, Paris, 1965.

    Google Scholar 

  12. M. Ohnishi and K. Matsumoto, “Gentzen method in modal calculi,” Osaka Math. J., 9 (1957), no. 2, 113-130, “Correction,” Osaka Math. J., 10 (1958), no. 1, 147.

    Google Scholar 

  13. M. Ohnishi and K. Matsumoto, “Gentzen method in modal calculi II,” Osaka Math. J., 11 (1959), no. 2, 115-120.

    Google Scholar 

  14. M. Takano, “Subformula property as a substitute for cut elimination in modal propositional logics,” Math. Japonica, 37 (1992), no. 6, 1129-1145.

    Google Scholar 

  15. R. M. Smullyan, “Analytic cut,” J. Symbolic Logic, 33 (1968), 560-564.

    Google Scholar 

  16. G. Boolos, The Logic of Provability, Cambridge Univ. Press, Cambridge, 1993.

    Google Scholar 

  17. A. Chagrov and M. Zakharyaschev, Modal Logic, Oxford Sci. Publ., 1997.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zolin, E.E. Sequential Reflexive Logics with Noncontingency Operator. Mathematical Notes 72, 784–798 (2002). https://doi.org/10.1023/A:1021485712270

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021485712270

Navigation