Complexity-Theoretic Algebra: Vector Space Bases

In 1975 Metakides and Nerode [16] initiated the systematic study of recursion theoretic algebra. The motivation was to establish the recursive content of mathematical constructions. The novelty then was the uniform use of the finite injury priority method from recursion theory as a tool to meet algebraic requirements. Prior to that time the priority method had been limited primarily to internal applications within recursion theory in the theory of recursively enumerable sets and in the theory of degrees of unsolvability and their generalizations.

[1]  Yehoshua Bar-Hillel,et al.  The Intrinsic Computational Difficulty of Functions , 1969 .

[2]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[3]  A. Nerode,et al.  Recursively enumerable vector spaces , 1977 .

[4]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[5]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

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

[7]  Jeffrey B. Remmel,et al.  On r.e. and co-r.e. vector spaces with nonextendible bases , 1980, Journal of Symbolic Logic.

[8]  J. Remmel.  Recursion theory on algebraic structures with independent sets , 1980 .

[9]  Anil Nerode,et al.  Complexity-Theoretic Algebra II: Boolean Algebras , 1989, Ann. Pure Appl. Log..

[10]  A. Nerode,et al.  Effective content of field theory , 1979 .

[11]  J. Remmel.  Recursively enumerable Boolean algebras , 1978 .

[12]  Uwe Schöning,et al.  Complexity and Structure , 1986, Lecture Notes in Computer Science.

[13]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[14]  Iraj Kalantari,et al.  Maximal Vector Spaces Under Automorphisms of the Lattice of Recursively Enumerable Vector Spaces , 1977, J. Symb. Log..

[15]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[16]  Wolfgang Maass,et al.  Oracle-Dependent Properties of the Lattice of NP Sets , 1983, Theor. Comput. Sci..

[17]  A. Nerode,et al.  Recursion theory and algebra , 1975 .

[18]  Jin-Yi Cai.  On Some Most Probable Separations of Complexity Classes , 1986 .

[19]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[20]  J. C. E. Dekker.  Two notes on vector spaces with recursive operations , 1971, Notre Dame J. Formal Log..