Wiktor Danko A Criterion of Undecidability of Algorithmic Theories. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 1981, v:4, n:3, pp:605-628 [Journal]
Wiktor Danko The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure is Decidable with Respect to Its Diagram. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 1993, v:19, n:3/4, pp:417-431 [Journal]