Premium
A Basis in Semi‐Reduced Form for the Admissible Rules of the Intuitionistic Logic IPC
Author(s) -
Rybakov Vladimir V.,
Terziler Mehmet,
Remazki Vitaliy
Publication year - 2000
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/(sici)1521-3870(200005)46:2<207::aid-malq207>3.0.co;2-e
Subject(s) - mathematics , basis (linear algebra) , propositional calculus , intuitionistic logic , intermediate logic , calculus (dental) , algebra over a field , discrete mathematics , pure mathematics , theoretical computer science , computer science , description logic , medicine , geometry , dentistry
We study the problem of finding a basis for all rules admissible in the intuitionistic propositional logic IPC. The main result is Theorem 3.1 which gives a basis consisting of all rules in semi‐reduced form satisfying certain specific additional requirements. Using developed technique we also find a basis for rules admissible in the logic of excluded middle law KC.