Coding Methods in Computability Theory and Complexity Theory

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees, it has been used to determine the complexity of the elementary theory, to provide restrictions on automorphisms, and even to obtain definability results (work of Harrington, Nies, Shore, Slaman, and others). We describe how a similar program can be carried out for several other structures, including the structure of c.e. many one degrees, the structure of c.e. weak truth table degrees and the lattice of c.e. sets under inclusion. In all cases we will obtain undecidability of, or even an interpretation of true arithmetic in the theory of the structure. For the c.e. many one-degrees, we also obtain definability results and restrictions on automorphisms. This work appeared first as the author's habilitation thesis at the Universitaet Heidelberg, 1998.

[1]  Richard J. Lipton,et al.  On the Structure of Sets in NP and Other Complexity Classes , 1981, Theor. Comput. Sci..

[2]  Donald A. Martin,et al.  Classes of Recursively Enumerable Sets and Degrees of Unsolvability , 1966 .

[3]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[4]  R. Soare.  Automorphisms of the lattice of recursively enumerable sets , 1974 .

[5]  André Nies,et al.  Undecidable fragments of elementary theories , 1996 .

[6]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[7]  Michael Stob,et al.  The intervals of the lattice of recursively enumerable sets determined by major subsets , 1983, Ann. Pure Appl. Log..

[8]  Franco Montagna,et al.  Universal Recursion Theoretic Properties of R.E. Preordered Structures , 1985, J. Symb. Log..

[9]  Donald A. Martin,et al.  Axiomatizable Theories with Few Axiomatizable Extensions , 1970, J. Symb. Log..

[10]  Theodore A. Slaman,et al.  On the theory of the PTIME degrees of the recursive sets , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[11]  André Nies.  Recursively Enumerable Equivalence Relations Modulo Finite Differences , 1994, Math. Log. Q..

[12]  R. Shore.  The recursively enumerable α-degrees are dense , 1976 .

[13]  A. Lachlan.  ON THE LATTICE OF RECURSIVELY ENUMERABLE SETS , 1968 .

[14]  R. Shore.  The Theory of the Degrees below 0 , 1981 .

[15]  Alistair H. Lachlan.  Embedding nondistributive lattices in the recursively enumerable degrees , 1972 .

[16]  C. E. M. Yates.  A Minimal Pair of Recursively Enumerable Degrees , 1966, J. Symb. Log..

[17]  André Nies,et al.  Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees , 1995, Ann. Pure Appl. Log..

[18]  André Nies,et al.  Definability in the Recursively Enumerable Degrees , 1996, Bulletin of Symbolic Logic.

[19]  André Nies.  Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras , 1997 .

[20]  A. Lachlan.  Initial Segments of Many-One Degrees , 1970, Canadian Journal of Mathematics.

[21]  Emil L. Post.  Recursively enumerable sets of positive integers and their decision problems , 1944 .

[22]  Manuel Lerman,et al.  Degrees of Unsolvability: Local and Global Theory , 1983 .