Talk by Mikhail Rybakov: “Logics for Describing Computations: Syntax, Semantics, and Complexity”

On September 24, M. N. Rybakov gave a talk entitled “Logics for Describing Computations: Syntax, Semantics, and Complexity” at the L. L. Maksimova “Non-Classical Logics” Seminar, held at the Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences.

The talk presented an overview of results concerning the complexity of the decision problem for various propositional logical systems whose languages can describe computations.