Results 261 to 270 of about 86,968 (310)

Normal Companions of Intuitionistic Modal Logics

Algebra and Logic, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 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   +1 more source

On Independent Axiomatizability of Quasi-Normal Modal Logics

Studia Logica, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gorbunov, Igor, Shkatov, Dmitry
openaire   +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   +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.
Božić, Milan, Došen, Kosta
openaire   +2 more sources

Infinitary propositional normal modal logic

Studia Logica, 1987
The author introduces a propositional normal modal logic, denoted by \(KL_{\omega_ 1}\), with countable conjunction and disjunction. He gives the Hilbert type formulation of \(KL_{\omega_ 1}\), defines the class of Kripke frames characteristic for this logic (completeness theorem) and proves that \(KL_{\omega_ 1}\) has the Craig interpolation property.
openaire   +2 more sources

Normal Modal Substructural Logics with Strong Negation

Journal of Philosophical Logic, 2003
This paper defines a large variety of propositional substructural logics that are extended to include two modal operators, ! (for `of course') and ? (for `why not'), and especially to include an operator, \(\sim\), for Nelson's strong negation (constructible falsity).
openaire   +2 more sources

Sequent Calculi for Normal Modal Propositional Logics

Journal of Logic and Computation, 1994
This is a streamlined exposition of \textit{N. Belnap}'s display logic DL [J. Philos. Logic 11, 375-417 (1982; Zbl 0509.03008)]. DL can be seen as an encoding of a formalization introduced by \textit{S. Kripke} [Z. Math. Logik Grundlagen Math. 9, 67-96 (1963; Zbl 0118.013)] where finite systems of sequents \(S; \sigma_ 1 S_ 1; \sigma_ 2 S_ 2;\dots ...
openaire   +2 more sources

Logical Consequence in Modal Logic: Alternative Semantic Systems for Normal Modal Logics

1973
Publisher Summary This chapter discusses the alternative semantic systems of normal modal logics. The novelty of the approach discussed in the chapter is twofold: first, to treat modal logics as consequence systems rather than logistic systems; and second, to view modal logics as extensions of non-modal ones.
openaire   +1 more source

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   +1 more source