The class of decision problems that are reducible to FOLL languages under TC0-computable Turing reductions.
For an Abelian group G and an arbitrary group H given by their multiplication tables, deciding whether G and H are isomorphic belongs to TC0(FOLL). [CTW13].
No class.