Decidability of MLSSP

  • Domenico Cantone
  • Pietro Ursino


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.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Dipartimento di Matematica e InformaticaUniversità degli Studi di CataniaCataniaItaly
  2. 2.Dipartimento di Fisica e MatematicaUniversità degli Studi dell’InsubriaComoItaly

Personalised recommendations