# Workshop "Computability and Models"

## Almaty, Kazakhstan, June 24-28, 2002

## ABSTRACTS

- Pavel Alaev, Computable Homogenious Boolean Algrbras
- Asel Altaeva, Precomplete
Arithmetical Equivalences
- Marat Arslanov, Relatively c.e., n-c.e. and fixed-point free degrees
- Serikzhan Badaev, Arithmetical Numberings
- Yerzhan Baisalov, On Erdös-Woods Conjecture
- Stanislav Bereznyuk, On Hyperarithmetical Numberings
- John Case, A Computability-Theoretic Learning Theory Sampler
- John Case, Machine Learning for a Genomics Analogy Problem
- Vyacheslav Dobritsa, On the Limitly Constructible Models
- Perdebek Dosanbai, Definability in Arithmetical Structures
- Ekaterina Fokina, On Degrees of Uncountably Categorical Theories with Computable Models
- Sergey Goncharov, Computability and Autostability
- Asya Ivleva, Unit Groups of Integral Group Rings
- Iskander Kalimullin, The Jump Operator Is Definable in the Enumeration Degrees
- Klaus Keimel, Domain theoretical models for probability and measure
- Asylkhan Khisamiev, Computable Imbeddability Condition and Degrees of Abelian Groups and Boolean Algebras
- Zarif Khisamiev, On Completion of
Arithmetical Numberings
- Nazif Khisamiev, Vitalii Roman'kov, Constructive Matrix and Ordered Groups
- Julia Knight, Isomorphism problems
- Oleg Kudinov,
- Beibut Kulpeshov, On Some Properties of Weakly o-minimal Theories
- Kuanysh Meirembekov, Ryll-Nardzewski Function of Countably Categorical Theories
- Abyz Nurtazin, Two Properties of Countably Categorical Universals
- Mikhail Peretyat'kin, Lindenbaum Algebra of Predicate Logic and Its Structure
- Sergei Podzorov, Algebraic Properties of Rogers Semilattices of Arithmetical Numberings
- Anna Romina, Autostability of Models in Admissible Structures
- Pavel Semukhin, Spectrum of the Atomless Elements Ideal
- Boris Solon, Strong Enumeration Reducibilities
- Dieter Spreen, On the Effective Continuity of Effective Multifunctions
- Frank Stephan, Learning Classes of Approximations to Non-Recursive Functions
- Dzhamalbek Tusupov, Generalized Computability on Countable Atomic Boolean Algebras
- Aibat Yeshkeyev, Some Properties of Jonson Theories