On intermediate predicate logics of some finite Kripke frames. I: Levelwise uniform trees (Q1770592)

It is well known that any propositional intermediate logic characterized by a finite Kripke frame is finitely axiomatizable. The analogous result, however, does not hold in the first-order case. In fact, a simple counter-example has already been given by the author of this paper. In this paper, the author develops the study on those logics characterized by trees of finite height satisfying a property called `levelwise uniform', which means, roughly, that each node of the same level has a number of branches fixed uniformly. The main theorem establishes a very simple criterion for the finite axiomatizability in the class of such logics; a logic characterized by such a tree is finitely axiomatizable iff the tree is `increasing' in the sense that any branching number of a node (determined by its level uniformly) does not become smaller at any higher level.