Extending Action Logic with Omega Iteration
Logic in Computer Science
2025-12-09 v1 Logic
Abstract
We present a proof system that extends action logic by omega iteration, which is viewed as infinitary multiplicative conjunction. We prove cut admissibility and establish complexity bounds for the provability predicate.
Keywords
Cite
@article{arxiv.2512.06985,
title = {Extending Action Logic with Omega Iteration},
author = {Tikhon Pshenitsyn},
journal= {arXiv preprint arXiv:2512.06985},
year = {2025}
}
Comments
technical report, draft