Infinitary Action Logic with Multiplexing

Infinitary action logic can be naturally expanded by adding exponential and subexponential modalities from linear logic. In this article we shall develop infinitary action logic with a subexponential that allows multiplexing (instead of contraction). Both non-commutative and commutative versions of this logic will be considered, presented as infinitary sequent calculi. We shall prove cut admissibility for these calculi, and estimate the complexity of the corresponding derivability problems: in both cases it will turn out to be between complete first-order arithmetic and the ωω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega ^\omega $$\end{document} level of the hyperarithmetical hierarchy. Here the complexity upper bound is much lower than that for the system with a subexponential that allows contraction. The complexity lower bound in turn is much higher than that for infinitary action logic.