We work in D[< 0 ]. Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high2. We show t...
In this paper we first survey recent advances on phase transition phenomena which are related to natural subclasses of the recursive functions. Special emphasis is put on descent ...
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...