Results 271 to 280 of about 156,774 (303)

Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi

, 1963
Publisher Summary This chapter discusses semantical analysis of modal logic ii and non-normal modal propositional calculi. The proof of sufficiency, which is omitted by many, proceeds by constructing a normal characteristic matrix by Lindenbaum's method.
Saul A. Kripke
semanticscholar   +1 more source

Models for normal intuitionistic modal logics

Studia Logica, 1984
Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given for analogues of the modal system \({\mathbb{K}}\) based on Heyting's propositional logic. It is shown that these two relations can combine with each other in various ways.
Kosta Došen, Milan Božić
openaire   +3 more sources

Modal sequents for normal modal logics

Mathematical Logic Quarterly, 1993
AbstractWe present sequent calculi for normal modal logics where modal and propositional behaviours are separated, and we prove a cut elimination theorem for the basic system K, so as completeness theorems (in the new style) both for K itself and for its most popular enrichments. MSC: 03B45, 03F05.
openaire   +2 more sources

Non-Deterministic Many-Valued Modal Logic

IEEE International Symposium on Multiple-Valued Logic, 2022
In this paper, we extend the techniques of non-deterministic semantics for propositional logics introduced by Arnon Avron and Iddo Lev to provide an account of modal operators. We examine the counterparts of the standard concepts from deterministic modal
T. M. Ferguson
semanticscholar   +1 more source

Normal derivability in modal logic

MLQ, 2005
The main result of this paper is the following theorem: Derivations in the system of natural deduction for S4 ith general elimination rules are normalizing. The standard rule of necessitation for the modal logic S4 prevents normalization of dervations.
openaire   +2 more sources

Clausal resolution for normal modal logics

Journal of Algorithms, 2007
We present a clausal resolution-based method for normal modal logics. Differently from other approaches, where inference rules are based on the syntax of a particular set of axioms, we focus on the restrictions imposed on the binary accessibility relation for each particular normal logic.
Nalon, C., Dixon, C.
openaire   +2 more sources

Interpretations of intuitionist logic in non-normal modal logics [PDF]

Journal of Philosophical Logic, 1999
By a result of Hacking, Tarski translation \(t\) interprets the intuitionistic propositional calculus \(\mathbf { IPC}\) in the non-normal modal logic \(\mathbf { S3}\) (i.e. \(\mathbf { IPC} \vdash A\) iff \(\mathbf { S3} \vdash t(A)\), for any formula \(A\)).
openaire   +2 more sources

Normal predicative logics with graded modalities

Studia Logica, 1988
In this work we extend results from ``Graded modalities. I-III'' [see the review above; Part III is to appear] about propositional calculi with graded modalities to the predicative level. Our semantics is based on Kripke models with a single domain of interpretation for all the worlds.
openaire   +3 more sources

Conditional logics of normality: A modal approach

Artificial Intelligence, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Amalgamation and interpolation in normal modal logics

Studia Logica, 1991
This paper is a survey of results on interpolation in propositional normal modal logics. Interpolation properties of these logics are closely connected with amalgamation properties of varieties of modal algebras. Therefore, the results on interpolation are also reformulated in terms of amalgamation.
openaire   +2 more sources