Writing out unifiers for formulas with coefficients in intuitionistic logic

DOI10.1093/jigpal/jzs015zbMath1277.03004OpenAlexW2045570821MaRDI QIDQ4925166

Vladimir Vladimirovich Rybakov

Publication date: 11 June 2013

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

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

zbMATH Keywords

unificationintuitionistic logicadmissible rulescomplete set of unifiers

Mathematics Subject Classification ID

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

Related Items (5)

UNIFICATION IN INTERMEDIATE LOGICS ⋮ Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation ⋮ Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK ⋮ DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV ⋮ Rules with parameters in modal logic. I.

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