On the positive fragment of the polymodal provability logic GLP

DOI10.1134/S0001434612030029MaRDI QIDQ2435945zbMATH OpenFDO

Authors E. V. Dashkov

Publication date 21 February 2014

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0001434612030029

zbMATH Keywords

complexity of a decision proceduredeductive systemequational calculusGLPgraded provability logicKripke semantics

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of the closed fragment of Japaridze's provability logic
• On provability logics with linearly ordered modalities
• scientific article; zbMATH DE number 4195937
• Linear \(\mathrm{GLP}\)-algebras and their elementary theories
• Kripke semantics for provability logic GLP

Cites work

• A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
• A new semantics for positive modal logic
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• Islands of tractability for relational constraints: towards dichotomy results for the description logic \({\mathcal{EL}}\)
• Kripke semantics for provability logic GLP
• Locality and subsumption testing in \({\mathcal{EL}}\) and some of its extensions
• On strong provability predicates and the associated modal logics
• Positive modal logic
• Provability algebras and proof-theoretic ordinals. I
• PSPACE-decidability of Japaridze's polymodal logic
• The worm principle

Cited in

(17)

• 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
• Linear \(\mathrm{GLP}\)-algebras and their elementary theories
• Positive provability logic for uniform reflection principles
• On provability logics with linearly ordered modalities
• The intuitionistic temporal logic of dynamical systems
• On the complexity of the closed fragment of Japaridze's provability logic
• 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
• Minimal models and the complexity of fragments of the logic of proofs
• Reflection calculus and conservativity spectra
• AN ESCAPE FROM VARDANYAN’S THEOREM
• Strictly positive fragments of the provability logic of Heyting arithmetic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2435945)