On the Relative Complexity of Modal Tableaux
Guido Governatori · Computing: The Australasian Theory Symposium · 2003
We investigate the relative complexity of two free-variable labelled modal tableaux (KEM and Single Step Tableaux, SST). We discuss the reasons why p-simulation is not a proper measure of the relative complexity of tableaux-like proof systems, and we propose an improved comparison scale (p-search-simulation). Finally we show that KEM p-search-simulates SST while SST cannot p-search-simulate KEM.