2 citations · 10 across the 16 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.LO2025
Extending Action Logic with Omega Iteration
Tikhon Pshenitsyn
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 complexit…
math.LO2025
First-Order Intuitionistic Linear Logic and Hypergraph Languages
Tikhon Pshenitsyn
The Lambek calculus is a substructural logic known to be closely related to the formal language theory: on the one hand, it is used for generating formal languages by means of cate…
cs.FL2025
Complexity of decision problems for hyperedge replacement grammars
Tikhon Pshenitsyn
This paper investigates complexity of various decision problems for hyperedge replacement grammars, starting with the uniform membership problem. It turns out that the complexity o…