V. Yu. Shavrukov

12 papers Journal 12
YearRankTypeTitle / Venue / Authors
2022 J jnl
On Guaspari's problem about partially conservative sentences.
Ann. Pure Appl. Log.
Taishi Kurahashi, Yuya Okawa, V. Yu. Shavrukov, Albert Visser
2016 J jnl
Duality, non-standard elements, and dynamic properties of r.e. sets.
Ann. Pure Appl. Log.
V. Yu. Shavrukov
2014 J jnl
Uniform Density in Lindenbaum Algebras.
Notre Dame J. Formal Log.
V. Yu. Shavrukov, Albert Visser
2010 J jnl
Effectively inseparable Boolean algebras in lattices of sentences.
Arch. Math. Log.
V. Yu. Shavrukov
2008 J jnl
The ∀∃ Theory of Peano σ
J. Math. Log.
Per Lindström, V. Yu. Shavrukov
2004 J jnl
Monoid presentations of groups by finite special string-rewriting systems.
RAIRO Theor. Informatics Appl.
Duncan W. Parkes, V. Yu. Shavrukov, Richard M. Thomas
1997 J jnl
Undecidability in Diagonalizable Algebras.
J. Symb. Log.
V. Yu. Shavrukov
1996 J jnl
Remarks on Uniformly Finitely Precomplete Positive Equivalences.
Math. Log. Q.
V. Yu. Shavrukov
1994 J jnl
A Smart Child of Peano's.
Notre Dame J. Formal Log.
V. Yu. Shavrukov
1993 J jnl
A Note on the Diagonalizable Algebras of PA and ZF.
Ann. Pure Appl. Log.
V. Yu. Shavrukov
1991 J jnl
On Rosser's Provability Predicate.
Math. Log. Q.
V. Yu. Shavrukov
1991 J jnl
The Lindenbaum fixed point algebra is undecidable.
Stud Logica
V. Yu. Shavrukov
2025 Best paper conf
Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja.
CheckMATE
Nicolò Altamura, Enrico Bragastini, Marco Campion, Mila Dalla Preda
2026 Best paper preprint
ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage.
arXiv
Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski