Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 45, Number 1 (2004), 13-18.
A Simple Embedding of T into Double S5
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 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.
Notre Dame J. Formal Logic, Volume 45, Number 1 (2004), 13-18.
First available in Project Euclid: 2 September 2004
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Kuhn, Steven. A Simple Embedding of T into Double S5. Notre Dame J. Formal Logic 45 (2004), no. 1, 13--18. doi:10.1305/ndjfl/1094155276. https://projecteuclid.org/euclid.ndjfl/1094155276