journal article Mar 01, 1999

Normal monomodal logics can simulate all others

Abstract
AbstractThis paper shows that non-normal modal logics can be simulated by certain polymodal normal logics and that polymodal normal logics can be simulated by monomodal (normal) logics. Many properties of logics are shown to be reflected and preserved by such simulations. As a consequence many old and new results in modal logic can be derived in a straightforward way, sheding new light on the power of normal monomodal logic.
Topics

No keywords indexed for this article. Browse by subject →

References
32
[1]
Recursive Undecidability of a Problem of Thue (1947)
[2]
Annals of Mathematics (1958)
[3]
(1979)
[4]
Transactions of the American Mathematical Society (1980)
[5]
Studia Logica (1989)
[6]
(1980)
[7]
The undecidability of the disjunction property and other related problems (1993)
[8]
Studio Logica (1992)
[9]
(1994)
[10]
The finite model property in tense logic (1995)
[11]
(1984)
[12]
Journal of Logic and Computation (1994)
[13]
(1973)
[14]
Archive of Mathematical Logic (1988)
[15]
(1983)
[16]
(1982)
[17]
Properties of independently axiomatizable bimodal logics (1991)
[18]
Journal of Logic and Computation (1995)
[19]
(1993)
[20]
(1997)
[21]
Journal of Logic and Computation (1992)
[22]
Journal of Philosophical Logic (1993)
[23]
(1987)
[24]
Ergebnisse eines mathe-matischen Kolloquiums (1933)
[25]
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (1976)
[26]
Theoria (1975)
[27]
Reduction of tense logic to modal logic I (1974)
[28]
Notre Dame Journal of Formal Logic (1986)
[29]
Annals of Pure and Applied Logic (1988)
[30]
(1975)
[31]
(1979)
[32]
Doklady Akademia Nauk SSSR (1951)
Cited By
47
A semantic hierarchy for intuitionistic logic

Guram Bezhanishvili, Wesley H. Holliday · 2019

Indagationes Mathematicae
Metrics
47
Citations
32
References
Details
Published
Mar 01, 1999
Vol/Issue
64(1)
Pages
99-138
License
View
Cite This Article
Marcus Kracht, Frank Wolter (1999). Normal monomodal logics can simulate all others. The Journal of Symbolic Logic, 64(1), 99-138. https://doi.org/10.2307/2586754
Related

You May Also Like

On the logic of theory change: Partial meet contraction and revision functions

Carlos E. Alchourrón, Peter Gärdenfors · 1985

1,988 citations

A formulation of the simple theory of types

Alonzo Church · 1940

1,037 citations

Nicht konstruktiv beweisbare Sätze der Analysis

Ernst Specker · 1949

229 citations

Quantales and (noncommutative) linear logic

David N. Yetter · 1990

213 citations

On the Restraining Power of Guards

Erich Grädel · 1999

191 citations