I seem to be not understanding correctly what reductions means for Languages.
for example, Lets say there is a Language called LM.
I want to see if LM is recursive or not, to do that lets say I find a reduction from L-Halting problem to LM.
and I assume that LM is recursive, so I show that then L-Halting problem is also recursive, which of course is false therefore LM is not recursive.
but can I say that LM is RE because I found a way to reduce LH to LM? if not how can I show that LM is RE?