Invited Speakers

• Uri Andrews: The global structure of equivalence relations under computable reducibility
  (University of Wisconsin-Madison, US)
  Abstract
• Serikzhan Badaev: Problems on computable numberings
  (Kazakh-British Technical University, Almaty, Kazakhstan)
  Abstract
• Marat Faizrakhmanov: On A-computable Families: Numberings, Rogers and Degtev Semilattices
  (Kazan Federal University, Russia)
  Abstract Slides
• Ekaterina Fokina: Bi-embeddability and computable structures
  (Technische Universität Wien, Austria)
  Abstract
• Su Gao: The undecidability of a graph homomorphism problem
  (University of North Texas, US)
  Abstract
• Sergey Goncharov Computable numberings on the approach by Sorbi and Goncharov
  (Sobolev Institute of Mathematics, Novosibirsk, Russia)
  Abstract Slides
• Noam Greenberg: Completeness of hyperarithmetic isomorphism
  (Victoria University of Wellington, New Zealand)
  Abstract
• Julia Knight: Describing structures and classes of structures
  (University of Notre Dame, US)
  Abstract
• Russell Miller: Bounded reductions between equivalence relations
  (Queens College, City University of New York, US)
  Abstract
• Alexei Myasnikov: Rich structures and weak second order logic
  (Stevens Institute of Technology, US)
  Abstract
• André Nies: Calibrating word problems of groups via the complexity of equivalence relations
  (University of Auckland, New Zealand)
  Abstract Slides
• Andrea Sorbi: Initial segments of the degrees of computably enumerable equivalence relations
  (Università degli Studi di Siena, Italy)
  Abstract