Mathematical Logic Quarterly 42 (1):219-233 (1996)

Authors
John L. Bell
University of Western Ontario
Abstract
A polymodal lattice is a distributive lattice carrying an n-place operator preserving top elements and certain finite meets. After exploring some of the basic properties of such structures, we investigate their freely generated instances and apply the results to the corresponding logical systems — polymodal logics — which constitute natural generalizations of the usual systems of modal logic familiar from the literature. We conclude by formulating an extension of Kripke semantics to classical polymodal logic and proving soundness and completeness theorems
Keywords Polymodality  Polymodal lattice  Polymodal logic  Filtroid
Categories (categorize this paper)
DOI 10.1002/malq.19960420119
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,018
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

The Mathematics of Metamathematics.Helena Rasiowa - 1963 - Warszawa, Państwowe Wydawn. Naukowe.
An Introduction to Modal Logic.E. J. Lemmon, Dana Scott & Krister Segerberg - 1979 - Journal of Symbolic Logic 44 (4):653-654.
Universal Algebra.George Grätzer - 1982 - Studia Logica 41 (4):430-431.

View all 7 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Normal Monomodal Logics Can Simulate All Others.Marcus Kracht & Frank Wolter - 1999 - Journal of Symbolic Logic 64 (1):99-138.
The Analytical Completeness of Dzhaparidze's Polymodal Logics.George Boolos - 1993 - Annals of Pure and Applied Logic 61 (1-2):95-111.
Display Calculi for Logics with Relative Accessibility Relations.Stéphane Demri & Rajeev Goré - 2000 - Journal of Logic, Language and Information 9 (2):213-236.
Decidable Fragments of First-Order Modal Logics.Frank Wolter & Michael Zakharyaschev - 2001 - Journal of Symbolic Logic 66 (3):1415-1438.
Models of Transfinite Provability Logic.David Fernández-Duque & Joost J. Joosten - 2013 - Journal of Symbolic Logic 78 (2):543-561.
Infinite Substructure Lattices of Models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
Kripke Semantics for Provability Logic GLP.Lev D. Beklemishev - 2010 - Annals of Pure and Applied Logic 161 (6):756-774.
On the Representation of N4-Lattices.Sergei P. Odintsov - 2004 - Studia Logica 76 (3):385 - 405.

Analytics

Added to PP index
2013-12-01

Total views
12 ( #714,112 of 2,324,077 )

Recent downloads (6 months)
1 ( #688,650 of 2,324,077 )

How can I increase my downloads?

Downloads

My notes