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

Abstract

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.

Citation

Download Citation

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

Information

Published: June 2005
First available in Project Euclid: 1 July 2005

zbMATH: 1086.03022
MathSciNet: MR2140040
Digital Object Identifier: 10.2178/jsl/1120224722

Rights: Copyright © 2005 Association for Symbolic Logic

JOURNAL ARTICLE
9 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.70 • No. 2 • June 2005
Back to Top