Abstract
We study propositional logical systems arising from the language of Johansson’s minimal logic and obtained by weakening the requirements for the negation operator. We present their semantics as a variant of neighbourhood semantics. We use duality and completeness results to show that there are uncountably many subminimal logics. We also give model-theoretic and algebraic definitions of filtration for minimal logic and show that they are dual to each other. These constructions ensure that the propositional minimal logic has the finite model property. Finally, we define and investigate bi-modal companions with non-normal modal operators for some relevant subminimal systems, and give infinite axiomatizations for these bi-modal companions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This property is equivalent to \(w \in \mathrm{N}(X) \Longleftrightarrow w \in \mathrm{N}(X \cap R(w))\) for every \(w \in W\) and \(X \in \mathcal {U}(W,\le )\); see, e.g., [12, Lemma 4.3.1].
References
van Benthem, J., Pacuit, E.: Dynamic logics of evidence-based beliefs. Studia Logica 99(1–3), 61–92 (2011)
Bezhanishvili, G., Bezhanishvili, N.: An algebraic approach to filtrations for superintuitionistic logics. In: Liber Amicorum Albert Visser. Tributes Series, vol. 30, pp. 47–56 (2016)
Bezhanishvili, G., Bezhanishvili, N.: Locally finite reducts of Heyting algebras and canonical formulas. Notre Dame J. Form. Log. 58(1), 21–45 (2017)
Bezhanishvili, G., Moraschini, T., Raftery, J.G.: Epimorphisms in varieties of residuated structures. J. Algebra 492, 185–211 (2017)
Bezhanishvili, N.: Lattices of intermediate and cylindric modal logics. Ph.D. thesis, ILLC Dissertations Series DS-2006-02, Universiteit van Amsterdam (2006)
Bezhanishvili, N., de Jongh, D., Tzimoulis, A., Zhao, Z.: Universal models for the positive fragment of intuitionistic logic. In: Hansen, H.H., Murray, S.E., Sadrzadeh, M., Zeevat, H. (eds.) TbiLLC 2015. LNCS, vol. 10148, pp. 229–250. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-54332-0_13
BĂlková, M., Colacito, A.: Proof theory for positive logic with weak negation. Studia Logica (2019, to appear)
Blackburn, P., De Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2002)
Caicedo, X., Cignoli, R.: An algebraic approach to intuitionistic connectives. J. Symb. Log. 66(04), 1620–1636 (2001)
Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford Logic Guides, vol. 35. The Clarendon Press, New York (1997)
Chellas, B.F.: Modal Logic: An Introduction. Cambridge University Press, Cambridge (1980)
Colacito, A.: Minimal and subminimal logic of negation. Master’s thesis, ILLC Master of Logic Series Series MoL-2016-14, Universiteit van Amsterdam (2016)
Colacito, A., de Jongh, D., Vargas, A.L.: Subminimal negation. Soft Comput. 21(1), 165–174 (2017)
Ertola, R.C., Galli, A., Sagastume, M.: Compatible functions in algebras associated to extensions of positive logic. Log. J. IGPL 15(1), 109–119 (2007)
Hansen, H.H.: Monotonic modal logics. Master’s thesis, ILLC Prepublication Series PP-2003-23, Universiteit van Amsterdam (2003)
Hazen, A.P.: Subminimal negation. University of Melbourne Philosophy Department, Preprint 1/92 (1992)
Hazen, A.P.: Is even minimal negation constructive? Analysis 55, 105–107 (1995)
Humberstone, L.: The Connectives. MIT Press, Cambridge (2011)
Jankov, V.A.: The construction of a sequence of strongly independent superintuitionistic propositional calculi. Sov. Math. Dokl. 9, 806–807 (1968)
Johansson, I.: Der Minimalkalkül, ein reduzierter intuitionistischer Formalismus. Compositio mathematica 4, 119–136 (1937)
de Jongh, D.: Investigations on the intuitionistic propositional calculus. Ph.D. thesis, ILLC Historical Dissertation Series HDS-5, Universiteit van Amsterdam (1968)
Kolmogorov, A.N.: On the principle of excluded middle. Matematicheskii Sbornik 32(24), 646–667 (1925)
Lemmon, E.J.: An introduction to modal logic: the lemmon notes. In: Collaboration with Scott, D., Segerberg, K. (eds.) American Philosophical Quarterly. Monograph Series, vol. 11. Basil Blackwell, Oxford (1977)
McKinsey, J.C.C.: A solution of the decision problem for the Lewis systems S2 and S4, with an application to topology. J. Symb. Logic 6, 117–134 (1941)
McKinsey, J.C.C., Tarski, A.: The algebra of topology. Ann. Math. 54, 141–191 (1944)
Odintsov, S.: Constructive Negations and Paraconsistency. Trends in Logic, vol. 26. Springer, Dordrecht (2008). https://doi.org/10.1007/978-1-4020-6867-6
Ă–zgĂĽn, A.: Evidence in epistemic logic: a topological perspective. Ph.D. thesis, ILLC Dissertations Series DS-2017-07, Universiteit van Amsterdam (2017)
Pacuit, E.: Neighborhood Semantics for Modal Logic. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67149-9
Rasiowa, H.: An Algebraic Approach to Non-classical Logics. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, Amsterdam (1974)
Segerberg, K.: An Essay in Classical Modal Logic, vols. 1–3. Filosofiska Föreningen och Filosofiska Institutionen vid Uppsala Universitet (1971)
Acknowledgments
We would like to thank the referees for their careful reading, which has helped us to clarify a number of issues and improve the paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer-Verlag GmbH Germany, part of Springer Nature
About this paper
Cite this paper
Bezhanishvili, N., Colacito, A., Jongh, D.d. (2019). A Study of Subminimal Logics of Negation and Their Modal Companions. In: Silva, A., Staton, S., Sutton, P., Umbach, C. (eds) Language, Logic, and Computation. TbiLLC 2018. Lecture Notes in Computer Science(), vol 11456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-59565-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-59565-7_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-59564-0
Online ISBN: 978-3-662-59565-7
eBook Packages: Computer ScienceComputer Science (R0)