Article contents
The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2005
References
REFERENCES
- 7
- Cited by