The finite model property with respect to admissibility for superintuitionistic logic (Q1876415)

Sufficient conditions are found for superintuitionistic logic to lack or possess the finite model property with respect to admissibility. For every superintuitionistic logic \(\lambda\) of width greater than 2 that possesses the co-cover property and the finite model property with respect to admissibility, a sequence \(R\) of admissible inference rules is constructed. This sequence has the following property: There is an \(r\in R\) admissible in \(\lambda\) but disprovable in some finite intuitionistic frame of width greater than 2.