Abstract
We introduce modal propositional substructural logics with strong negation, and prove the completeness theorems (with respect to Kripke models) for these logics.
Similar content being viewed by others
REFERENCES
Akama, S., 1997: On constructive modality, in S. Akama (ed.), Logic, Language and Computation, Kluwer Academic Publishers, pp. 143–158.
Almukdad, A. and Nelson, D., 1984: Constructible falsity and inexact predicates, J. Symbolic Logic 49, 231–233.
Bucalo, A., 1994: Modalities in linear logic weaker than the exponential “of course”: Algebraic and relational semantics, J. Logic, Language, and Information 3, 211–232.
Corsi, G., 1987: Weak logics with strict implication, Z. Math. Logik Grundlag. Math. 33, 389–406.
D'Agostino, M., Gabby, D. M. and Russo, A., 1997: Grafting modalities onto substructural implicational systems, Studia Logica 59, 65–102.
Dam, M., 1994: Process-algebraic interpretations of positive linear and relevant logics, J. Logic Comput. bd4, 939–973.
Došen, K., 1988a: Sequent systems and groupoid models. I, Studia Logica 47, 353–385.
Došen, K., 1988b: Sequent systems and groupoid models. II, Studia Logica 48, 41–65.
Fuhrman, A., 1990: Models for relevant modal logics, Studia Logica 49, 501–514.
Goble, L., 2000: An incomplete relevant modal logic, J. Philos. Logic 29, 163–119.
Ishihara, H., 2000: A canonical model construction for substructural logics, J. Universal Comput. Sci. 6, 155–168.
Kamide, N., 2002a: A canonical model construction for substructural logics with strong negation, Rep. Math. Logic 36, 95–116.
Kamide, N., 2002b: Kripke semantics for modal substructural logics, J. Logic, Language, and Information 11, 453–470.
Kamide, N., 2002c: Sequent calculi for intuitionistic linear logic with strong negation, Logic J. IGPL bd10, 653–678.
Lafont, Y. (to appear): Soft linear logic and polynomial time, Theoret. Comput. Sci.
Mares, E. D., 1993: Classically complete modal relevant logics, Math. Logic Quarterly 39, 165–177.
Mares, E. D. and Meyer, R. K., 1993: The semantics of R4, J. Philos. Logic 22, 95–110.
Méndez, J. M., 1987: A Routley-Meyer semantics for converse Ackermann property, J. Philos. Logic bd16, 65–76.
Nelson, D., 1949: Constructible falsity, J. Symbolic Logic 14, 16–26.
Ono, H., 1993: Semantics for substructural logics, in K. Došen and P. Schroeder-Heister (eds.), Substructural Logics, Oxford University Press, Oxford, pp. 259–291.
Ono, H., 1997: A note on Visser's basic propositional logic, manuscript.
Ono, H. and Y. Komori, 1985: Logics without the contraction rule, J. Symbolic Logic 50, 169–201.
Routley, R., 1974: Semantical analysis of propositional systems of Fitch and Nelson, Studia Logica 33, 283–298.
Sasaki, K., 1999: Formalizations for the consequence relation of Visser's propositional logic, Rep. Math. Logic 33, 65–78.
Seki, T., 2003: A Sahlqvist theorem for relevant modal logics, Studia Logica 73, 383–411.
Suzuki, Y. and Ono, H., 1997: Hilbert style proof system for BPL, Research Report of Japan Advanced Institute of Science and Technology.
Thomason, H., 1969: A semantical study of constructible falsity, Z. Math. Logik Grundlag. Math. 15, 247–257.
Troelstra, A. S., 1992: Lectures on Linear Logic, CSLI Lecture Notes 29, CSLI, Stanford, CA.
Urquhart, A., 1972: Semantics for relevant logics, J. Symbolic Logic 37, 159–169.
Venema, Y., 1995: Meeting strength in substructural logics, Studia Logica 54, 3–32.
Visser, A., 1981: A propositional logic with explicit fixed points, Studia Logica 40, 155–174.
Wansing, H., 1993a: The logic of information structures, in Lecture Notes in Artificial Intelligence 681, Springer-Verlag, Berlin, pp. 1–163.
Wansing, H., 1993b: Informational interpretation of substructural propositional logics, J. Logic, Language and Information bd2, 285–308.
Wansing, H., 2002: Diamonds are a philosopher's best friends - the knowability paradox and modal epistemic relevant logic, J. Philos. Logic 31, 591–612.
Rights and permissions
About this article
Cite this article
Kamide, N. Normal Modal Substructural Logics with Strong Negation. Journal of Philosophical Logic 32, 589–612 (2003). https://doi.org/10.1023/B:LOGI.0000003928.44012.57
Issue Date:
DOI: https://doi.org/10.1023/B:LOGI.0000003928.44012.57