By placing a tetrahedron on a face and making vertical cuts centered at the "top" vertex, it is easy to dissect the tetrahedron into $1, 2, 3,$ or $6$ congruent pieces.
By cutting the tetrahedron into four identical pyramids meeting at the center, one for each face, we can further subdivide these pyramids to yield a total of $4, 8, 12,$ or $24$ congruent pieces.
However, it's not obvious to me how to do anything more interesting than this in a way that yields dissections into other numbers of pieces - unlike the triangle, which can be subdivided into many smaller equilateral triangles, the tetrahedron does not decompose into congruent smaller regular tetrahedra, so there is no natural way to 'bootstrap' these constructions to higher numbers of pieces. In particular, I'm most interested in the question of whether a tetrahedron can be dissected into arbitrarily high numbers of pieces.
Some options that come to mind:
Some of the pieces resulting from one of the above dissections might have a further dissection I haven't thought of.
Polyforms on the tetrahedral-octahedral honeycomb could potentially work to tile a tetrahedron of large side length, just as some polyominoes tile a square and some polyiamonds tile a larger triangle. (However, since the ratio of tetrahedra to octahedra in a given finite tetrahedral portion of the honeycomb monotonically decreases with the side length of said tetrahedron, any given polyform will work with at most one scale.) See also this question on MSE.
Perhaps something like Dehn invariants could to used to attempt a proof of impossibility, somehow? I'd be skeptical, though.