Complexity classes and number of problems
I know that almost all of complexity classes that have some significance have infinite number of decision problems.
Then what about complete area of these complexity classes? I know that the concept of complete is somewhat artificial, as it depends on some reduction processes.
So, for example, will NP-complete contain infinite number of problems?