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

Skvortsov, Dmitrij

J. Symbolic Logic, Tome 70 (2005) no. 1, p. 451-459 / Harvested from Project Euclid

Résumé

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.

Publié le : 2005-06-14
Classification:

@article{1120224722,
     author = {Skvortsov, Dmitrij},
     title = {The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable},
     journal = {J. Symbolic Logic},
     volume = {70},
     number = {1},
     year = {2005},
     pages = { 451-459},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1120224722}
}

Skvortsov, Dmitrij. The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable. J. Symbolic Logic, Tome 70 (2005) no. 1, pp.  451-459. http://gdmltest.u-ga.fr/item/1120224722/