Embeddings of Propositional Logics into the Provability Logics S and D
Mashu Noguchi
Abstract
Just as Visser showed that the formal propositional logic FPL can be embedded into Gödel-Löb provability logic GL, Petrukhin proposed a propositional logic SPL that can be embedded into Solovay's non-normal provability logic S. In this paper, we fix Petrukhin's proof and extend the result to Japaridze's provability logic D, and propose a propositional logic DPL that can be embedded into D.
Create a lesson
Related papers
Stalnaker's logical problem of conditionals is unsolvable
Alexander W. Kocurek, James Walsh, Yale Weiss
Strong completeness of the logic J
Juan P. Aguilera, Grigorii Stepanov
Lévy-Montague reflection is Π11-conservative over WKL0
Fedor Pakhomov
Contact relations on bounded distributive lattices and related structures
Ivo Düntsch, Rafał Gruszczyński
Some results on NIP groups and their Ellis groups
Atticus Stonestrom
Group-extensive embeddings into Fraïssé structures and stationary weak independence relations
Aleksandra Kwiatkowska, Rob Sullivan, Jeroen Winkel