2 citations · 10 across the 16 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.LO2026
Exact Complexity of the Satisfiability Problem for Strategy Logic
Tikhon Pshenitsyn
We show that the satisfiability problem for Strategy Logic introduced by Mogavero, Murano, and Vardi is -complete, and, more strongly, computably isomorphic to true sec…
math.LO2026
Wider systems for linear logic with fixed points: proof theory and complexity
Anupam Das, Tikhon Pshenitsyn
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal for fixed points. Our main re…