Strong completeness with respect to finite kripke models

Studia Logica 40 (3):249-252 (1981)
  Copy   BIBTEX

Abstract

We prove that each intermediate or normal modal logic is strongly complete with respect to a class of finite Kripke frames iff it is tabular, i.e. the respective variety of pseudo-Boolean or modal algebras, corresponding to it, is generated by a finite algebra.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,394

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
45 (#493,659)

6 months
9 (#488,506)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The mathematics of metamathematics.Helena Rasiowa - 1963 - Warszawa,: Państwowe Wydawn. Naukowe. Edited by Roman Sikorski.
Universal Algebra.George Grätzer - 1982 - Studia Logica 41 (4):430-431.
The Mathematics of Metamathematics.Donald Monk - 1963 - Journal of Symbolic Logic 32 (2):274-275.
The Finite Model Property and Subsystems of Classical Propositional Calculus.Ronald Harrop - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (1-2):29-32.

Add more references