LEM doesn't overlook completeness within the context of an axiom system. Independent results remain, by definition, without correspondence to any proof.
Believe it or not, constructive math actually does have a LEM, but a derived one. Any computable value can be shown to either equal or not equal another. Only for uncomputable predicates does the absence of LEM result in our inability to conclude x from not not x.
Believe it or not, constructive math actually does have a LEM, but a derived one. Any computable value can be shown to either equal or not equal another. Only for uncomputable predicates does the absence of LEM result in our inability to conclude x from not not x.