Unification in subsystems of polymodal provability logic GLP
From MaRDI portal
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 topological study of the closed fragment of GLP
- Admissibility of logical inference rules
- Admissible Rules of Modal Logics
- Best solving modal equations
- Blending margins: the modal logic K has nullary unification type
- Intermediate logics and Visser's rules
- 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 unification problem for \(\operatorname{GLP} \)
- Undecidability of the unification and admissibility problems for modal and description logics
- Unification in intuitionistic logic
- Unification through projectivity
- Unifiers in transitive modal logics for formulas with coefficients (meta-variables)
- Writing out unifiers for formulas with coefficients in intuitionistic logic
- Über das Auflösungsproblem im logischen Klassenkalkul.
This page was built for publication: Unification in subsystems of polymodal provability logic GLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6900935)