I am prety stuck over here:
prove or disprove that every $L$ got $L'$ s.t $L'\geq L$ and for every $L''\geq L$
basically it means L' is the hardest...
my intuition tells me that this is correct, but I cant prove why. I tried to prove using counting but got stuck:
we got $\aleph_0$ pairs of functions that we can use in the reduction for both ways
we got $\aleph$ languages so there must be a language that got a function to compute the redaction in one way and doesnt got a function for the reduction to the other way
Its feels terribly incorrect any help will be appreciated
EDIT: I just realized that I didn't write the question correctly please read it again.