Abstract:
Admissible inference rules for table modal and superintuitionistic logics are investigated. $K$-saturated logics are defined semantically. Such logics are proved to have finite bases for admissible inference rules in finitely many variables.