Monoidal logics: completeness and classical systems.

Monoidal logics were introduced as a foundational framework to analyze the proof theory of logical systems. Inspired by Lambek's seminal work in categorical logic, the objective is to define logical systems in order to make explicit their categorical (monoidal) structure. In this setting, logical connectives can be proven to be functors with specific properties. Accordingly, monoidal logics allow a classification of logical systems in function of their categorical structure and the functorial properties of their connectives. As they stand, however, strong parallels can be made between monoidal logics and the broader proof-theoretical framework of display logics. In this paper, we extend the results presented in Peterson ((2016). A comparison between monoidal and substructural logics. Journal of Applied Non-Classical Logics, 26(2), 126–159) and we show that monoidal logics are sound and complete with respect to associative display logics, thus providing a completeness result with regards to the algebraic semantics of display and substructural logics. In addition, we discuss the notions of classical and intuitionistic systems. Starting from Lambek's and Grishin's analyses, we explore the role played by partial De Morgan dualities and discuss the necessary and sufficient conditions required for the definitions of classical and intuitionistic deductive systems. [ABSTRACT FROM AUTHOR]