Abstract
In this short note, we will discuss some problems related to noncommutative substructural logics. Here, by noncommutative substructural logics, we mean substructural logics which have neither exchange rules nor axioms for exchange, in general. So, they include some extensions of Lambek calculus and some of relevant logics, for which many works have been done. (See, e.g., [3, 4, 6, 9] and [10].) On the other hand, they haven’t been discussed so often within a common framework. Here, we will try to discuss some problems on noncommutative substructural logics on the common base and to show where the noncommutativity will play peculiar roles in them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrusci, V. M., `Phase Semantics and Sequent Calculus for Pure Noncommutative Classical Linear Propositional Logic’, J. Symbolic Logic, 56 (1991), 1403–1451.
Ackermann, W., ‘Begründung einer Strengen Implikation’, J. Symbolic Logic, 21 (1956), 113–128.
Anderson, A. R. and Belnap, N. D., Jr., Entailment, The Logic of Relevance and Necessity I, Princeton Univ. Press, 1975.
Anderson, A. R., Belnap, N. D., Jr., and Dunn, J. M., Entailment, The Logic of Relevance and Necessity II, Princeton Univ. Press, 1992.
Bayu Surarso and Ono, H., `Cut Elimination in Noncommutative Substructural Logics’, Reports on Mathematical Logic, 30 (1996), 13–29.
Van Benthem, J., Language in Action: Categories, Lambdas and Dynamic Logic, North-Holland, 1991.
Brady, R. T., `The Gentzenization and Decidability of RW’, J. Philos. Logic, 19 (1990), 35–73.
Brady, R. T., `Gentzenization and Decidability of Some Contraction-Less Relevant Logics’, J. Philos. Logic, 20 (1991), 97–117.
Buszkowski, W., Marciszewski, W., and van Benthem, J. (eds), Categorial Grammar, Benjamins, 1988.
Daten, K. and Schroeder-Heister, P. (eds), Substructural Logics, Oxford Univ. Press, 1993.
Dunn, J. M., `Relevance Logic and Entailment’, in D. Gabbay and F. Guenthner (eds), Handbook of Philosophical Logic III, 1986, pp. 117–224.
Fine, K., `Models for Entailment’, J. Philos. Logic, 3 (1974), 347–372.
Iséki, K., `On BCK-Algebras with Condition (S)’, Math. Japonica, 25 (1980), 625–626.
Kiriyama, E. and Ono, H., `The Contraction Rule and Decision Problems for Logics without Structural Rules’, Studia Logica, 50 (1991), 299–319.
Komori, Y., `Syntactical Investigations into BI Logic and BB’I Logic’, Studio Logica, 53 (1994), 397–416.
Lambek, J., `The Mathematics of Sentence Structure’, Amer. Math. Monthly, 65 (1958), 154–169.
Ono, H., `Structural Rules and a Logical Hierarchy’, in R. R. Petkov (ed.), Mathematical Logic, Plenum Press, 1990, pp. 95–104.
Ono, H., `Decidability and Finite Model Property of Substructural Logics’, in J. Ginzburg et al. (eds), The Tbilisi Symposium on Language, Logic and Computation,CSLI Lecture Note, 1998, pp. 263274.
Ono, H. and Komori, Y., `Logics without the Contraction Rule’, J. Symbolic Logic,50 (1985), 169201.
Salomaa, A., Jewels of Formal Language Theory, Computer Science Press, 1981.
Trigg, R, Hindley, J. R., and Bunder, M. W., `Combinatory Abstraction using B, B’ and Friends’, Theoret. Comput. Sci., 135 (1994), 405–422.
Urquhart, A., `The Undecidability of Entailment and Relevant Implication’, J. Symbolic Logic, 49 (1984), 1059–1073.
Yetter, D. N., `Quantales and (Noncommutative) Linear Logic’, J. Symbolic Logic, 55 (1990), 41–64.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Ono, H. (1999). Some Observations on Noncommutative Substructural Logics. In: Cantini, A., Casari, E., Minari, P. (eds) Logic and Foundations of Mathematics. Synthese Library, vol 280. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2109-7_13
Download citation
DOI: https://doi.org/10.1007/978-94-017-2109-7_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5201-8
Online ISBN: 978-94-017-2109-7
eBook Packages: Springer Book Archive