On the lattices of NP-subspaces of a polynomial time vector space over a finite field

This publication has 18 references indexed in Scilit:

• Recursively presented games and strategies
  Mathematical Social Sciences, 1992
• The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory
  Theoretical Computer Science, 1992
• Complexity-theoretic algebra II: Boolean algebras
  Annals of Pure and Applied Logic, 1989
• Oracle-dependent properties of the lattice of NP sets
  Theoretical Computer Science, 1983
• On r.e. and co-r.e. vector spaces with nonextendible bases
  The Journal of Symbolic Logic, 1980
• Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
  The Journal of Symbolic Logic, 1977
• Maximal and Cohesive vector spaces
  The Journal of Symbolic Logic, 1977
• Two notes on vector spaces with recursive operations.
  Notre Dame Journal of Formal Logic, 1971
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
  Mathematical Logic Quarterly, 1966
• On the computational complexity of algorithms
  Transactions of the American Mathematical Society, 1965