Viggo Stoltenberg-Hansen , Department of Mathematics, Uppsala University. Jouko Väänänen, Department of Mathematics and Statistics, University of Helsinki.

• Preface, TUTORIAL Generalizing finite model theory. RESEARCH ARTICLES Indestructibility and strong compactness, Some applications of regular markers, Has the continuum hypothesis been settled? Geometry of interaction IV: the feedback equation, On local modularity in homogeneous structures, Descriptive set theory and uncountable model theory, Decidable properties of logical calculi and of varieties of algebras, Stabilization - an alternative to double-negation translation for classical natural deduction, Definability and reducibility in higher types over the reals COLLOQUIUM PROGRAM Tutorial Speaker: Model theory and complexity theory, Set-theoretic methods in Ramsey theory. Plenary Speakers: Doing things to models: Trans-structural dynamic logics, Generalized model theory and Polish group actions, Has the CH been settled? From operator algebras to logic, The succinctness of monadic logics on finite trees, A survey of realizability toposes, On the history of modality as alternativeness, On the role of infinite cardinals, Applications of descriptive set theory to uncountable model theory, Decidable properties of logical calculi and of varieties of algebras, Are the objects of propositional attitudes propositions in the sense of propositional and predicate logic? Lascar strong types and topology, The continuous functionals in the perspective of domain theory, Inconsistent arithmetics and inconsistent computation, Consistency and games, Realizability, Forcing, and independence results for construc­tive theories, Good frames for what are they good? The boundary between decidability and undecidability in degree structures. Special Session, Model Theory, Simple groups of finite Morley rank, Random logarithm: An example of a homogeneous class of structures, The differential order, Set Theory: Indestructibility and strong compactness, Some applications of cubical markers, New canonization theorems and dense free subsets in N0, Outer models and genericity. Recursion Theory and Arithmetic: Generators of the computably enumerable degrees, Computable listings and autodimensions of rings and fields, Weak arithmetics and unrelativised independence results, Specification and computation on topological algebras, Inductive constructions for classical natural deduction, Problems of predicativity in constructive topology, Uncertain reasoning, Type-based termination of recursive definitions.