3 problems

Let CL, IL, and ILL denote classical, intuitionistic, and intuitionistic linear logic, respectively. Let $\mathrm{LL}^-$ be linear logic without concurrency or polarization. The no…

Automata-theoretic conjecture. There is some class of automata that is strictly weaker than TMs yet powerful enough to implement all the game-semantic PCF-computations.

Local-strategy completeness conjecture. The vertical negated edges may be rectified by passing to local strategies in the sense of the cited previous work.