Journal of Symbolic Logic

The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable

Dmitrij Skvortsov

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We prove that an intermediate predicate logic characterized by a class of finite partially ordered sets is recursively axiomatizable iff it is “finite”, i.e., iff it is characterized by a single finite partially ordered set. Therefore, the predicate logic LFin of the class of all predicate Kripke frames with finitely many possible worlds is not recursively axiomatizable.

Article information

J. Symbolic Logic, Volume 70, Issue 2 (2005), 451-459.

First available in Project Euclid: 1 July 2005

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Skvortsov, Dmitrij. The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable. J. Symbolic Logic 70 (2005), no. 2, 451--459. doi:10.2178/jsl/1120224722.

Export citation


  • D. M. Gabbay Decidability of some intuitionistic predicate theories, Journal of Symbolic Logic, vol. 30 (1972), pp. 579--587.
  • H. Ono Some problems in intermediate predicate logics, Reports on Mathematical Logic, vol. 21 (1987), pp. 55--67.
  • T. Shimura Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas, Studia Logica, vol. 52 (1993), no. 1, pp. 23--40.
  • D. Skvortsov On axiomatizability of some intermediate predicate logics (summary), Reports on Mathematical Logic, vol. 22 (1988), pp. 115--116.
  • C. A. Smoryński Applications of Kripke models, Metamathematical investigations of intuitionistic arithmetic and analysis (A. S. Troelstra, editor), Lecture Notes in Mathematics, vol. 344, Springer-Verlag, Berlin, Heidelberg, New York,1973, pp. 324--391.
  • B. A. Trachtenbrot Impossibility of an algorithm for the decision problem in finite classes, Doklady Akademii Nauk SSSR, vol. 70 (1950), no. 4, pp. 569--572, in Russian; English translation: American Mathematical Society Translations, Series 2, vol. 23 (1963), pp. 1--5.