The logics of individual Medvedev frames

Abstract Let $n$-Medvedev’s logic $\textbf{ML}_{n}$ be the intuitionistic logic of Medvedev frames based on the non-empty subsets of a set of size $n$, which we call $n$-Medvedev frames. While these are tabular logics, after characterizing $n$-Medvedev frames using the property of having at least $n$ maximal points, we offer a uniform axiomatization of them through a Gabbay-style rule corresponding to this property. Further properties including compactness, disjunction property, and structural completeness of $\textbf{ML}_{n}$ are explored and compared to those of Medvedev’s logic $\textbf{ML}$.