On the unification problem for GLP
From MaRDI portal
Publication:6986370
Cites work
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
- A simplified proof of arithmetical completeness theorem for provability logic GLP
- A topological study of the closed fragment of GLP
- Admissibility of logical inference rules
- Admissible bases via stable canonical rules
- Admissible Rules of Modal Logics
- Arithmetization of metamathematics in a general setting
- AXIOMATIZATION OF PROVABLE n-PROVABILITY
- Best solving modal equations
- Blending margins: the modal logic K has nullary unification type
- scientific article; zbMATH DE number 4164801 (Why is no real title available?)
- scientific article; zbMATH DE number 5046774 (Why is no real title available?)
- Interpolation properties for provability logics GL and GLP
- Kripke semantics for provability logic GLP
- Linear \(\mathrm{GLP}\)-algebras and their elementary theories
- On strong provability predicates and the associated modal logics
- On the admissible rules of intuitionistic propositional logic
- On the reduction property for GLP-algebras
- Proof theory for admissible rules
- Provability algebras and proof-theoretic ordinals. I
- Reflection principles and provability algebras in formal arithmetic
- Undecidability of the unification and admissibility problems for modal and description logics
- Unification in intuitionistic logic
This page was built for publication: On the unification problem for \(\operatorname{GLP} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986370)
