The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable
Keyword(s):
AbstractWe 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.
2004 ◽
Vol 2004
(40)
◽
pp. 2145-2147
1979 ◽
Vol 27
(4)
◽
pp. 495-506
◽
Keyword(s):
2013 ◽
Vol 12
(04)
◽
pp. 1250184
◽
Keyword(s):
1976 ◽
Vol 28
(4)
◽
pp. 820-835
◽
Keyword(s):
Keyword(s):
Keyword(s):
1964 ◽
Vol 16
◽
pp. 136-148
◽
Keyword(s):
1980 ◽
Vol 23
(2)
◽
pp. 231-236
◽