People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.

Abstract.

The problem of enumerating the types of Boolean functions under the group of variable permutations and complementations was first stated by Jevons in the 1870s, but not solved in a satisfactory way until the work of Pólya in 1940. This paper explains the details of Pólya's solution, and also the history of the problem from the 1870s to the 1970s.

A well known fact is that every Lebesgue measurable set is regular, i.e., it includes an Fσ set of the same measure. We analyze this fact from a metamathematical or foundational standpoint. We study a family of Muchnik degrees corresponding to measuretheoretic regularity at all levels of the effective Borel hierarchy. We prove some new results concerning Nies's notion of LR-reducibility. We build some ω-models of RCA0 which are relevant for the reverse mathematics of measure-theoretic regularity.

The study of propositional realizability logic was initiated in the 50th of the last century. Some interesting results were obtained in the 60-70th, but many important problems in this area are still open. Now interest to these problems from new generation of researchers is observed. This survey contains an exposition of the results on propositional realizability logic and corresponding techniques. Thus reading this paper can be the start point in exploring and development of constructive logic.

We announce some new results regarding the classification problem for separable von Neumann algebras. Our results are obtained by applying the notion of Borel reducibility and Hjorth's theory of turbulence to the isomorphism relation for separable von Neumann algebras.

A cofinitary group is a subgroup of Sym(ℕ) where all nonidentity elements have finitely many fixed points. A maximal cofinitary group is a cofinitary group, maximal with respect to inclusion. We show that a maximal cofinitary group cannot have infinitely many orbits. We also show, using Martin's Axiom, that no further restrictions on the number of orbits can be obtained. We show that Martin's Axiom implies there exist locally finite maximal cofinitary groups. Finally we show that there exists a uniformly computable sequence of permutations generating a cofinitary group whose isomorphism type is not computable.

We represent truth sets for a variety of the well known semantic theories of truth as those sets consisting of all sentences for which a player has a winning strategy in an infinite two person game. The classifications of the games considered here are simple, those over the natural model of arithmetic being all within the arithmetical class of .

We discuss the work of Paul Bernays in set theory, mainly his axiomatization and his use of classes but also his higher-order reflection principles.

We classify actions of groups of finite Morley rank on abelian groups of Morley rank 2: there are essentially two, namely the natural actions of SL(V) and GL(V) with V a vector space of dimension 2. We also prove an identification theorem for the natural module of SL2 in the finite Morley rank category.

We survey various aspects of the problem of automatic continuity of homomorphisms between Polish groups.