Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
Journal of Symbolic Logic
JELIA '90 Proceedings of the European Workshop on Logics in AI
Optionality, Scope, and Licensing: An Application of Partially Ordered Categories
Journal of Logic, Language and Information
Deep Inference in Bi-intuitionistic Logic
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Taming Displayed Tense Logics Using Nested Sequents with Deep Inference
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
| Hi-index | 0.00 |
Even though residuation is at the core of Categorial Grammar (Lambek, 1958), it is not always immediate to realize how standard logical systems like Multi-modal Categorial Type Logics (MCTL) (Moortgat, 1997) actually embody this property. In this paper, we focus on the basic system NL (Lambek, 1961) and its extension with unary modalities NL(♦) (Moortgat, 1996), and we spell things out by means of Display Calculi (DC) (Belnap, 1982; Goré, 1998). The use of structural operators in DC permits a sharp distinction between the core properties we want to impose on the logical system and the way these properties are projected into the logical operators. We will show how we can obtain Lambek residuated triple \, / and • of binary operators, and how the operators ♦and □↓ introduced by Moortgat (1996) are indeed their unary counterpart. In the second part of the paper we turn to other important algebraic properties which are usually investigated in conjunction with residuation (Birkhoff, 1967): Galois and dual Galois connections. Again, DC let us readily define logical calculi capturing them. We also provide preliminary ideas on how to use these new operators when modeling linguistic phenomena.