2 citations · 10 across the 16 of their papers we have counts for
5 papers · 1 filter
Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
Tikhon Pshenitsyn
In 2023, Kuznetsov and Speranski introduced infinitary action logic with multiplexing and proved that the derivability problem for it lies between the $ω…
Expressive Power of Hypergraph Lambek Grammars
Tikhon Pshenitsyn
Hypergraph Lambek grammars (HL-grammars) is a novel logical approach to generating graph languages based on the hypergraph Lambek calculus. In this paper, we establish a precise re…
On Decidability and Expressive Power of Fusion Grammars
Tikhon Pshenitsyn
We study algorithmic complexity and expressive power of fusion grammars, a novel formalism introduced in [Kreowski, Kuske, and Lye 2017], which extends hyperedge replacement gramma…
Multimodality in the Hypergraph Lambek Calculus
Tikhon Pshenitsyn
The multimodal Lambek calculus is an extension of the Lambek calculus that includes several product operations (some of them being commutative or/and associative), unary modalities…
From Double Pushout Grammars to Hypergraph Lambek Grammars With and Without Exponential Modality
Tikhon Pshenitsyn
We study how to relate well-known hypergraph grammars based on the double pushout (DPO) approach and grammars over the hypergraph Lambek calculus HL (called HL-grammars). It turns…