On the relative complexity of labelled modal tableaux
Contribuinte(s) |
J. Harland |
---|---|
Data(s) |
01/01/2003
|
Resumo |
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. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Elsevier B.V. |
Palavras-Chave | #Labelled modal tableaux #Relative complexity #E1 #230101 Mathematical Logic, Set Theory, Lattices And Combinatorics #780101 Mathematical sciences |
Tipo |
Conference Paper |