On the positive fragment of the polymodal provability logic GLP

DOI10.1134/S0001434612030029zbMath1315.03113MaRDI QIDQ2435945

E. V. Dashkov

Publication date: 21 February 2014

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Kripke semanticsdeductive systemGLPequational calculuscomplexity of a decision proceduregraded provability logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items (14)

Reflection algebras and conservation results for theories of iterated truth ⋮ Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics ⋮ The logic of Turing progressions ⋮ Positive provability logic for uniform reflection principles ⋮ Deducibility and independence in Beklemishev's autonomous provability calculus ⋮ AN ESCAPE FROM VARDANYAN’S THEOREM ⋮ Reflection calculus and conservativity spectra ⋮ On provability logics with linearly ordered modalities ⋮ On the complexity of the closed fragment of Japaridze's provability logic ⋮ The intuitionistic temporal logic of dynamical systems ⋮ A Note on Strictly Positive Logics and Word Rewriting Systems ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ Modal companions of \(K4^+\) ⋮ REFLECTION RANKS AND ORDINAL ANALYSIS

Cites Work

• Kripke semantics for provability logic GLP
• A new semantics for positive modal logic
• Provability algebras and proof-theoretic ordinals. I
• Positive modal logic
• On strong provability predicates and the associated modal logics
• A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the positive fragment of the polymodal provability logic GLP