A Simple Embedding of T into Double S5
Kuhn, Steven
Notre Dame J. Formal Logic, Tome 45 (2004) no. 1, p. 13-18 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
The system obtained by adding full propositional quantification to S5 is known to be decidable, while that obtained by doing so for T is known to be recursively intertranslatable with full second-order logic. Recently it was shown that the system with two S5 operators and full propositional quantification is also recursively intertranslatable with second-order logic. This note establishes that the map assigning [1][2]p to \squarep provides a validity and satisfaction preserving translation between the T system and the double S5 system, thus providing an easier proof of the recent result.
Publié le : 2004-01-14
Classification:  propositional quantifier,  2S5,  03B45 
@article{1094155276,
     author = {Kuhn, Steven},
     title = {A Simple Embedding of T into Double S5},
     journal = {Notre Dame J. Formal Logic},
     volume = {45},
     number = {1},
     year = {2004},
     pages = { 13-18},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1094155276}
}

Kuhn, Steven. A Simple Embedding of T into Double S5. Notre Dame J. Formal Logic, Tome 45 (2004) no. 1, pp.  13-18. http://gdmltest.u-ga.fr/item/1094155276/