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.

Categories

Keywords

Reprint years

DOI

10.1007/bf02584059

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

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

Through your library

My notes

Similar books and articles

Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free.Murdoch J. Gabbay - 2012 - Journal of Symbolic Logic 77 (3):828-852.
Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics II.Viorica Sofronie-Stokkermans - 2000 - Studia Logica 64 (2):151-172.
Normal modal substructural logics with strong negation.Norihiro Kamide - 2003 - Journal of Philosophical Logic 32 (6):589-612.
Intuitionistic axiomatizations for bounded extension Kripke models.Mohammad Ardeshir, Wim Ruitenburg & Saeed Salehi - 2003 - Annals of Pure and Applied Logic 124 (1-3):267-285.
A proof of topological completeness for S4 in.Grigori Mints & Ting Zhang - 2005 - Annals of Pure and Applied Logic 133 (1-3):231-245.
A propositional logic with explicit fixed points.Albert Visser - 1981 - Studia Logica 40 (2):155 - 175.
Properties of Tense Logics.Frank Wolter - 1996 - Mathematical Logic Quarterly 42 (1):481-500.
Quantified modal logic with neighborhood semantics.Geir Waagbø & G. Waagbø - 1992 - Mathematical Logic Quarterly 38 (1):491-499.
Completeness theorem for propositional probabilistic models whose measures have only finite ranges.Radosav Dordević, Miodrag Rašković & Zoran Ognjanović - 2004 - Archive for Mathematical Logic 43 (4):557-563.
Back and Forth Between First-Order Kripke Models.Tomasz Połacik - 2008 - Logic Journal of the IGPL 16 (4):335-355.
On the Modal Definability of Simulability by Finite Transitive Models.David Fernández Duque - 2011 - Studia Logica 98 (3):347-373.
Kripke-style models for typed lambda calculus.John C. Mitchell & Eugenio Moggi - 1991 - Annals of Pure and Applied Logic 51 (1-2):99-124.
Graded modalities. III (the completeness and compactness of s40).M. Fattorosi-Barnaba & C. Cerrato - 1988 - Studia Logica 47 (2):99 - 110.
A free IPC is a natural logic: Strong completeness for some intuitionistic free logics.Carl J. Posy - 1982 - Topoi 1 (1-2):30-43.
Kripke semantics, undecidability and standard completeness for Esteva and Godo's logic MTL∀.Franco Montagna & Hiroakira Ono - 2002 - Studia Logica 71 (2):227-245.

Analytics

Added to PP
2009-01-28

Downloads
31 (#488,695)

6 months
2 (#1,157,335)

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