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 semantics; deductive system; GLP; equational calculus; complexity of a decision procedure; graded provability logic

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03F45: Provability logics and related algebras (e.g., diagonalizable algebras)

Related Items

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

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