Chapter 10 Complexity theoretic model theory and algebra

This publication has 34 references indexed in Scilit:

• On the lattices of NP-subspaces of a polynomial time vector space over a finite field
  Annals of Pure and Applied Logic, 1996
• Feasible Graphs and Colorings
  Mathematical Logic Quarterly, 1995
• Decidable subspaces and recursively enumerable subspaces
  The Journal of Symbolic Logic, 1984
• Oracle-dependent properties of the lattice of NP sets
  Theoretical Computer Science, 1983
• Recursively categorical linear orderings
  Proceedings of the American Mathematical Society, 1981
• Recursive Colorings of Graphs
  Canadian Journal of Mathematics, 1980
• Autostability of models and Abelian groups
  Algebra and Logic, 1980
• Autostability and computable families of constructivizations
  Algebra and Logic, 1975
• Two notes on vector spaces with recursive operations.
  Notre Dame Journal of Formal Logic, 1971
• On the computational complexity of algorithms
  Transactions of the American Mathematical Society, 1965