V. Yu. Shavrukov

According to our database, V. Yu. Shavrukov authored at least 12 papers between 1991 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2022

On Guaspari's problem about partially conservative sentences.

Taishi Kurahashi, Yuya Okawa, V. Yu. Shavrukov, Albert Visser

Ann. Pure Appl. Log., 2022

2016

Duality, non-standard elements, and dynamic properties of r.e. sets.

V. Yu. Shavrukov

Ann. Pure Appl. Log., 2016

2014

Uniform Density in Lindenbaum Algebras.

V. Yu. Shavrukov, Albert Visser

Notre Dame J. Formal Log., 2014

2010

Effectively inseparable Boolean algebras in lattices of sentences.

V. Yu. Shavrukov

Arch. Math. Log., 2010

2008

The ∀∃ Theory of Peano σ₁ Sentences.

Per Lindström, V. Yu. Shavrukov

J. Math. Log., 2008

2004

Monoid presentations of groups by finite special string-rewriting systems.

Duncan W. Parkes, V. Yu. Shavrukov, Richard M. Thomas

RAIRO Theor. Informatics Appl., 2004

1997

Undecidability in Diagonalizable Algebras.

V. Yu. Shavrukov

J. Symb. Log., 1997

1996

Remarks on Uniformly Finitely Precomplete Positive Equivalences.

V. Yu. Shavrukov

Math. Log. Q., 1996

1994

A Smart Child of Peano's.

V. Yu. Shavrukov

Notre Dame J. Formal Log., 1994

1993

A Note on the Diagonalizable Algebras of PA and ZF.

V. Yu. Shavrukov

Ann. Pure Appl. Log., 1993

1991

The Lindenbaum fixed point algebra is undecidable.

V. Yu. Shavrukov

Stud Logica, 1991

On Rosser's Provability Predicate.

V. Yu. Shavrukov

Math. Log. Q., 1991