scientific article
From MaRDI portal
Publication:3085172
zbMATH Open1244.03073MaRDI QIDQ3085172FDOQ3085172
Publication date: 30 March 2011
Title of this publication is not available (Why is that?)
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Cited In (13)
- MÜNCHHAUSEN PROVABILITY
- AN ESCAPE FROM VARDANYAN’S THEOREM
- Kripke semantics for provability logic GLP
- PSPACE bounds for rank-1 modal logics
- On provability logics of Niebergall arithmetic
- Reflection calculus and conservativity spectra
- KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS
- On the positive fragment of the polymodal provability logic GLP
- COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
- Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
- Title not available (Why is that?)
- On the complexity of the closed fragment of Japaridze's provability logic
- Modal companions of \(K4^+\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085172)
