Studia Logica 40 (3):249-252 (1981)
| 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.
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.1007/BF02584059 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
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.
The Finite Model Property and Subsystems of Classical Propositional Calculus.Ronald Harrop - 1959 - Mathematical Logic Quarterly 5 (1‐2):29-32.
Citations of this work BETA
No citations found.
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.
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 index
2009-01-28
Total views
29 ( #358,131 of 2,411,838 )
Recent downloads (6 months)
1 ( #538,761 of 2,411,838 )
2009-01-28
Total views
29 ( #358,131 of 2,411,838 )
Recent downloads (6 months)
1 ( #538,761 of 2,411,838 )
How can I increase my downloads?
Downloads
