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

Studia Logica 77 (3):295 - 323 (2004)
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.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.1023/B:STUD.0000039028.22017.4f
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,169
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Added to PP index

Total downloads
17 ( #290,673 of 2,191,852 )

Recent downloads (6 months)
5 ( #42,050 of 2,191,852 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature