Special Session on Computable Mathematics

• Alexandra Shlapentokh*, East Carolina University: First-order and Diophantine Undecidability over function fields of positive characteristic

• Peter Cholak, University of Notre Dame, Peter Gerdes, Cambridge, MA, Karen Lange*, Wellesley College: Classifying $\mathcal{D}$-maximal sets

• Sebastian Wyman* and Douglas Cenzer, University of Florida: Weakening computability to classify $\Pi^0_1$ subshifts

• Peter Cholak*, Notre Dame, Damir Dzhafarov, Notre Dame, Noah Schweber, UC—Berkeley, Richard Shore, Cornell: Computably enumerable partial orders

• Mariya I. Soskova*, Sofia University: Extensions of the Turing model for relative definability

• Antonio Montalban* and Asher Kach, University of Chicago: Theories of classes of structures

• Jennifer Chubb Reimann*, University of San Francisco: Spectra of orderings of groups

• S. M. VanDenDriessche*, University of Notre Dame: Turing Computable Embeddings, $P$-groups, and $\Sigma^c_\alpha$ Sentences

• Uri Andrews, University of Wisconsin-Madison, Steffen Lempp*, University of Wisconsin-Madison, Joseph S Miller, University of Wisconsin, Keng Meng Ng, Nanyang Technological University, Luca San Mauro, Scuola Normale Superiore, Andrea Sorbi, University of Siena: Universal computably enumerable equivalence relations

• Robertson Bayer*, UC Berkeley: Low for Computational Speed

• Jan S Reimann*, Pennsylvania State University: Degree-invariant functions and uniform Borel reductions

• Wesley Calvert*, Southern Illinois University, Kunal Dutta, Institute of Mathematical Sciences, Chennai, India, Amritanshu Prasad, Institute of Mathematical Sciences, Chennai, India: Degeneration and orbits of tuples and subgroups

• Rumen D Dimitrov*, Macomb: Automorphisms of substructures of the lattice of subspaces of $V_{\infty }$ and derivatives

• David Diamondstone, Victoria University of Wellington, Johanna N. Y. Franklin*, University of Connecticut: Lowness for difference tests

• Ferit Toska* and Douglas Cenzer, University of Florida: Compressibility of Countable Subshifts

• Paul Shafer*, Appalachian State University: The Medvedev degrees as semantics for propositional logic

• Categoricity and relative categoricity of structures of familiar kinds. Jesse Johnson, University of Notre Dame, Julia Knight*, University of Notre Dame, Victor Ocasio, University of Notre Dame, Jamalbek Tussupov, Gumilev Eusasian National University, Astana, Kazakhstan, Steven VanDenDriessche, University of Notre Dame

• Alberto Marcone, Dipartimento di Matematica e Informatica, Università di Udine, Antonio Montalbán, Department of Mathematics, University of Chicago, Richard A Shore*, Department of Mathematics, Cornell University: Computing maximal chains in wpos

• Bernard Anderson, Gordon College, Barbara F Csima*, University of Waterloo: Degrees that are not degrees of categoricity

• Denis R. Hirschfeldt, University of Chicago, Asher M. Kach*, University of Chicago: Shift Complex Reals

• Alexandra A. Soskova*, Sofia University: Partial Degree Spectra

• Brooke M Andersen, Assumption College, Asher M Kach, University of Chicago, Alexander G Melnikov, University of Auckland, Reed Solomon*, University of Connecticut: Jump degrees of torsion free abelian groups

• Kai Maeda*, George Washington University: Turing degrees of isomorphic types of non-associative structures