|
List of invited speakers
The schedule of plenary talks and other events of the conference is available here.
Preliminary schedules of talks in sections are available in Russian, the English version for the computability theory can be found here.
At this moment, the list includes
- Klaus Ambos-Spies (Heidelberg, Germany): Strongly bounded Turing reducibilities,
- Marat Arslanov (Kazan', Russia): Applications of the Ershov difference hierarchy in the computable algebra and the complexity theory (abstract),
- Serikzhan Badaev (Almaty, Kazakhstan): Computable numberings in the Ershov hierarchy,
- Lev Beklemishev (Moscow, Russia): Provability algebras and scattered topology (abstract),
- Ulrich Berger (Swansea, UK): Realisability for coinduction with applications in computable analysis (abstract),
- S. Barry Cooper (Leeds, UK): Aspects of the Ershov hierarchy (abstract),
- B. Csima (Waterloo, Canada): The complexity of the upper and lower central series of computable nilpotent groups (abstract),
- Sy David Friedman (Vienna, Austria): Equivalence relations in set theory, computation theory and complexity theory (abstract),
- Sergei Goncharov (Novosibirsk, Russia): Strongly constructive models and enumerations,
- Noam Greenberg (Wellington, New Zealand): Effective properties of uncountable linear orderings (abstract),
- Iskander Kalimullin (Kazan', Russia): Degree spectra of algebraic structures,
- Klaus Keimel (Darmstadt, Germany): Scott--Ershov domains in topology and analysis,
- Asylkhan Khisamiev (Novosibirsk, Russia): Universal functions over locally finite algebraic systems (abstract),
- Salma Kuhlmann (Konstanz, Germany): Valued differential fields of exponential logarithmic series (abstract),
- Angus Macintyre (London, UK): Algebraic numbers definable in Zilber's exponential field,
- Andrei Mantsivoda (Irkutsk, Russia): Mediating between logic and object models,
- Alexei Miasnikov (Montreal, Canada): Zero-one laws, generic elementary theories, and random objects,
- Aleksandr Mikhalev (Moscow, Russia): Orthogonal completion in ring theory: the history and recent results,
- Antonio Montalban (Chicago, USA): Counting the back-and-forth types (abstract),
- Vadim Puzarenko (Novosibirsk, Russia): Natural numbers and the generalized computability,
- Theodore A. Slaman (Berkeley, USA): Effective randomness and continuous measures,
- Andrea Sorbi (Siena, Italy): The Medvedev lattice and intermediate propositional logics,
- Mariya Soskova (Sofia, Bulgaria): Definability and interpretability in the Sigma-0-2 enumeration degrees,
- Frank Stephan (Singapore, Singapore): Automatic structures and model theory (abstract),
- Aleksei Stukachev (Novosibirsk, Russia): Semilattices of Sigma-degrees of structures,
- Irina Suprunenko (Minsk, Belarus'): Modular representations of the classical algebraic groups: restrictions to subsystem subgroups and properties of individual elements (abstract),
- Andrei Vasil'ev (Novosibirsk, Russia): Characterization of finite simple groups by arithmetical properties (abstract),
- Evgenii Vdovin (Novosibirsk, Russia): On the intersection of conjugate subgroups of finite index (abstract).
Last update: April 29, 2010