On Rosser's Provability Predicate. - V. Yu. Shavrukov (Math. Log. Q., 1991)

The Lindenbaum fixed point algebra is undecidable. - V. Yu. Shavrukov (Stud Logica, 1991)

A Note on the Diagonalizable Algebras of PA and ZF. - V. Yu. Shavrukov (Ann. Pure Appl. Log., 1993)

A Smart Child of Peano's. - V. Yu. Shavrukov (Notre Dame J. Formal Log., 1994)

Remarks on Uniformly Finitely Precomplete Positive Equivalences. - V. Yu. Shavrukov (Math. Log. Q., 1996)

Undecidability in Diagonalizable Algebras. - V. Yu. Shavrukov (J. Symb. Log., 1997)

Monoid presentations of groups by finite special string-rewriting systems. - Duncan W. Parkes; V. Yu. Shavrukov; Richard M. Thomas (RAIRO Theor. Informatics Appl., 2004)

The ∀∃ Theory of Peano σ1 Sentences. - Per Lindström; V. Yu. Shavrukov (J. Math. Log., 2008)

Effectively inseparable Boolean algebras in lattices of sentences. - V. Yu. Shavrukov (Arch. Math. Log., 2010)

Uniform Density in Lindenbaum Algebras. - V. Yu. Shavrukov; Albert Visser (Notre Dame J. Formal Log., 2014)

Duality, non-standard elements, and dynamic properties of r.e. sets. - V. Yu. Shavrukov (Ann. Pure Appl. Log., 2016)

On Guaspari's problem about partially conservative sentences. - Taishi Kurahashi; Yuya Okawa; V. Yu. Shavrukov; Albert Visser (Ann. Pure Appl. Log., 2022)