TY - JOUR
AU - Romas Alonderis
PY - 2008/12/21
Y2 - 2022/10/04
TI - Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
JF - Lietuvos matematikos rinkinys
JA - LMR
VL - 48
IS - proc. LMS
SE - Articles
DO - 10.15388/LMR.2008.18105
UR - https://www.journals.vu.lt/LMR/article/view/18105
AB - In the paper, we define some classes of sequents of the propositional intuitionistic logic. These are classes of primarily and α-primarily reducible sequents. Then we show how derivability of these sequents in a propositional intuitionistic logic sequent calculus LJ0 can be checked by means of a propositional classical logic sequent calculus LK0.
ER -