Decidability of MLSSP
Towards a proof of the decidability of MLSSP, there are two fundamental goals to achieve. The first one consists in finding a shadow process that is good enough to create an assignment that L-simulates the original one and, therefore, using Lemma 2.24, also good enough to create a model for the original formula.
Unable to display preview. Download preview PDF.