Geodesic

Algorithmic aspects of algebra and logic

Sommaire

Foreword
p. 7-9
On a~semicontinuous function
p. 10-14
On normal subgroups in the periodic products of S.\,I.~Adian
p. 15-31
A simplified proof of arithmetical completeness theorem for provability logic $\mathbf{GLP}$
p. 32-40
Algorithmic tests and randomness with respect to a~class of measures
p. 41-102
On joint conditional complexity (entropy)
p. 103-118
Degrees of autostability relative to strong constructivizations
p. 119-129
On maximal chains of systems of word equations
p. 130-136
A palindromization map on free monoids
p. 137-147
A polynomial bound on solutions of quadratic equations in free groups
p. 148-190
Bilattices and hyperidentities
p. 191-209
Kolmogorov complexity and cryptography
p. 210-221
A survey of predicate realizability logic
p. 222-251
Degree-uniform lower bound on the weights of polynomials with given sign function
p. 252-268
On the Fon-Der-Flaass interpretation of extremal examples for Tur\'an's $(3,4)$-problem
p. 269-290
Finite quantifier hierarchies in relational algebras
p. 291-296
Comparison of expressive power of some query languages for databases
p. 297-313
Attainability of the minimal exponential growth rate for free products of finite cyclic groups
p. 314-328
Interpolation properties for provability logics $\mathbf{GL}$ and $\mathbf{GLP}$
p. 329-342
On squares of modal logics with additional connectives
p. 343-351