Writing out unifiers for formulas with coefficients in intuitionistic logic

DOI10.1093/JIGPAL/JZS015MaRDI QIDQ4925166zbMATH OpenOpenAlexFDO

Authors Vladimir Rybakov

Publication date 11 June 2013

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/jzs015

zbMATH Keywords

admissible rulescomplete set of unifiersintuitionistic logicunification

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20)

Recommendations

• Unifiers in transitive modal logics for formulas with coefficients (meta-variables)
• Unification in intuitionistic logic
• UNIFICATION IN INTERMEDIATE LOGICS
• Unification types in logic
• Unification problem in Nelson's logic \(\mathbf{N4}\)

Cited in

(10)

• Rules with parameters in modal logic. I.
• Writing out Unifiers in Linear Temporal Logic
• UNIFICATION IN INTERMEDIATE LOGICS
• Unifiers in transitive modal logics for formulas with coefficients (meta-variables)
• Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation
• DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
• UNIFICATION IN SUPERINTUITIONISTIC PREDICATE LOGICS AND ITS APPLICATIONS
• Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
• Unification in subsystems of polymodal provability logic GLP
• Unification problem in Nelson's logic \(\mathbf{N4}\)

This page was built for publication: Writing out unifiers for formulas with coefficients in intuitionistic logic

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