Skip to main content
Log in

Not Every "Tabular" Predicate Logic is Finitely Axiomatizable

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

An example of finite tree Mo is presented such that its predicate logic (i.e. the intermediate predicate logic characterized by the class of all predicate Kripke frames based on Mo) is not finitely axiomatizable. Hence it is shown that the predicate analogue of de Jongh - McKay - Hosoi's theorem on the finite axiomatizability of every finite intermediate propositional logic is not true.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Gabbay, D., and D. de Jongh, 1974, ‘Sequence of decidable finitely axiomatizable intermediate logics with the disjunction property’, J. of Symb. Logic 39, 67–78.

    Google Scholar 

  2. Ghilardi, S., 1989, ‘Presheaf semantics and independence results for some nonclassical first-order logics’, Archive for Math. Logic 29No.2 (1989), 125–136.

    Google Scholar 

  3. Hosoi, T., 1967, ‘On the axiomatic method and the algebraic method for dealing with propositional logics’, Journal of the Faculty of Science, Univ. of Tokyo, Sect.I 14, 131–169.

    Google Scholar 

  4. McKay, C. G., 1967, ‘On finite logics’, Indag. Math. 29, 363–365.

    Google Scholar 

  5. Skvortsov, D., 1995, ‘On the predicate logic of finite Kripke frames’, Studia Logica 54, 79–88.

    Google Scholar 

  6. Skvortsov, D., 1996, ‘On finite intersections of intermediate predicate logics’, In: Logic and Algebra (ed. A. Ursini and P. Agliano), Marcel Dekker, N.Y., (Proc. of Intern. Conf. on Logic and Algebra in memory of R.Magari, Siena, 1994), 667–688.

    Google Scholar 

  7. Skvortsov, D., ‘On predicate logics of some finite Kripke frames’. In preparation.

  8. Yokota, S., 1989, ‘Axiomatization of the first-order intermediate logics of bounded Kripkean heights,I’, Zeitschr. für math, Logik und Grundl. der Math. 35, 414–421.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Skvortsov, D. Not Every "Tabular" Predicate Logic is Finitely Axiomatizable. Studia Logica 59, 387–396 (1997). https://doi.org/10.1023/A:1005088429206

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005088429206

Navigation