The isomorphism problem for classes of computable fields. - Wesley Calvert (Arch. Math. Log., 2004)

The isomorphism problem for computable Abelian p-groups of bounded length. - Wesley Calvert (J. Symb. Log., 2005)

Effective categoricity of equivalence structures. - Wesley Calvert; Douglas Cenzer; Valentina S. Harizanov; Andrei S. Morozov (Ann. Pure Appl. Log., 2006)

Classification from a Computable Viewpoint. - Wesley Calvert; Julia F. Knight (Bull. Symb. Log., 2006)

Computable trees of Scott rank ω1CK, and computable approximation. - Wesley Calvert; Julia F. Knight; Jessica Millar (J. Symb. Log., 2006)

Index sets for classes of high rank structures. - Wesley Calvert; Ekaterina B. Fokina; Sergei S. Goncharov; Julia F. Knight; Oleg V. Kudinov; Andrei S. Morozov; Vadim Puzarenko (J. Symb. Log., 2007)

Infinitary Queries in Spatial Databases - Wesley Calvert; John E. Porter (CoRR, 2008)

Real Computable Manifolds and Homotopy Groups. - Wesley Calvert; Russell G. Miller (UC, 2009)

Categoricity of computable infinitary theories. - Wesley Calvert; Sergei S. Goncharov; Julia F. Knight; Jessica Millar (Arch. Math. Log., 2009)

Effective categoricity of Abelian p-groups. - Wesley Calvert; Douglas A. Cenzer; Valentina S. Harizanov; Andrei S. Morozov (Ann. Pure Appl. Log., 2009)

The Cardinality of an Oracle in Blum-Shub-Smale Computation - Wesley Calvert; Ken Kramer; Russell G. Miller (CCA, 2010)

Computability of julia sets by Mark Braverman and Michael Yampolsky, Publisher: Springer, 2009. - Wesley Calvert (SIGACT News, 2010)

Noncomputable functions in the Blum-Shub-Smale model - Wesley Calvert; Ken Kramer; Russell G. Miller (Log. Methods Comput. Sci., 2011)

The Distance Function on a Computable Graph - Wesley Calvert; Russell G. Miller; Jennifer Chubb Reimann (CoRR, 2011)

Metric structures and probabilistic computation. - Wesley Calvert (Theor. Comput. Sci., 2011)

Review of process algebra: equational theories of communicating processes by J. C. M. Baeten, T. Basten, and M. A. Reniers. - Wesley Calvert (SIGACT News, 2012)

Review of universal semantic communication by B. Juba. - Wesley Calvert (SIGACT News, 2013)

Formalization of Generalized Constraint Language: A Crucial Prelude to Computing With Words. - Elham Sahebkar Khorasani; Shahram Rahimi 001; Wesley Calvert (IEEE Trans. Cybern., 2013)

Turing Degrees of Isomorphism Types of Geometric Objects. - Wesley Calvert; Valentina S. Harizanov; Alexandra Shlapentokh (Comput., 2014)

PAC learning, VC dimension, and the arithmetic hierarchy. - Wesley Calvert (Arch. Math. Log., 2015)

Genericity and UD-random reals. - Wesley Calvert; Johanna N. Y. Franklin (J. Log. Anal., 2015)

Strong jump inversion. - Wesley Calvert; Andrey N. Frolov; Valentina S. Harizanov; Julia F. Knight; Charles F. D. McCoy; Alexandra A. Soskova; Stefan V. Vatev (J. Log. Comput., 2018)

Generically and coarsely computable isomorphisms. - Wesley Calvert; Douglas Cenzer; Valentina S. Harizanov (Comput., 2022)

Interpreting a field in its Heisenberg Group. - Rachael Alvir; Wesley Calvert; Grant Goodman; Valentina S. Harizanov; Julia F. Knight; Russell G. Miller; Andrey S. Morozov; Alexandra A. Soskova; Rose Weisshaar (J. Symb. Log., 2022)

Densely computable structures. - Wesley Calvert; Douglas Cenzer; Valentina S. Harizanov (J. Log. Comput., 2022)

Generically Computable Abelian Groups. - Wesley Calvert; Douglas Cenzer; Valentina S. Harizanov (UCNC, 2023)

Structural Highness Notions. - Wesley Calvert; Johanna N. Y. Franklin; Dan Turetsky (J. Symb. Log., 2023)

In Memory of Martin Davis. - Wesley Calvert; Valentina S. Harizanov; Eugenio G. Omodeo; Alberto Policriti; Alexandra Shlapentokh (CoRR, 2024)

Generically computable linear orderings. - Wesley Calvert; Douglas Cenzer; David Gonzalez; Valentina S. Harizanov (Ann. Pure Appl. Log., 2025)

Normality, Relativization, and Randomness. - Wesley Calvert; Emma Gruner; Elvira Mayordomo; Daniel Turetsky; Java Darleen Villano (Theory Comput. Syst., 2025)