On intermediate predicate logics of some finite Kripke frames, I. levelwise uniform trees

Studia Logica 77 (3):295 - 323 (2004)
  Copy   BIBTEX

Abstract

An intermediate predicate logic L is called finite iff it is characterized by a finite partially ordered set M, i.e., iff L is the logic of the class of all predicate Kripke frames based on M. In this paper we study axiomatizability of logics of this kind. Namely, we consider logics characterized by finite trees M of a certain type (levelwise uniform trees) and establish the finite axiomatizability criterion for this case.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,480

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
30 (#386,282)

6 months
1 (#417,474)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references