Results 281 to 290 of about 156,774 (303)

Semantic Incompleteness of Liberman et al. (2020)'s Hilbert-style System for Term-modal Logic K with Equality and Non-rigid Terms

Non-Classical Logic. Theory and Applications
In this paper, we prove the semantic incompleteness of the Hilbert-style system for the minimal normal term-modal logic with equality and non-rigid terms that was proposed in Liberman et al.
Takahiro Sawasaki
semanticscholar   +1 more source

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   +3 more sources

A lattice of normal modal logics [PDF]

Algebra and Logic, 1974
Vladimir V. Rybakov, L. L. Maksimova
openaire   +1 more source

Models for stronger normal intuitionistic modal logics

Studia Logica, 1985
This paper, a sequel to the one reviewed above (see Zbl 0634.03014), which dealt with intuitionistic analogues of the modal system \({\mathbb{K}}\), deals similarly with intuitionistic analogues of systems stronger than \({\mathbb{K}}\), and, in particular, analogues of S4 and S5.
openaire   +2 more sources

The decidable normal modal logics are not recursively enumerable

Journal of Philosophical Logic, 1985
The author uses a construction of Urquhart to show that there is no effective enumeration of algorithms which includes at least one for every decidable normal modal logic and no others. This also shows that the set of all recursive presentations which determine decidable modal logics is not recursively enumerable.
openaire   +1 more source

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   +3 more sources

On the Finite Model Property of Non-normal Modal Logics

Logic, Rationality, and Interaction, 2023
Yu Peng, Yiheng Wang
semanticscholar   +1 more source

From Classical to Normal Modal Logics

1996
Classical modal logics (Segerberg [27], Chellas [2]) are weaker than the well-known normal modal logics: The only rule that is common to all classical modal logics is (We nevertheless note that this principle raises problems in systems containing equality (Hughes and Cresswell [14]).)
Andreas Herzig, Olivier Gasquet
openaire   +2 more sources

On detachment-substitutional formalization in normal modal logics

Studia Logica, 1977
The aim of this paper is to propose a criterion of finite detachment-substitutional formalization for normal modal systems. The criterion will comprise only those normal modal systems which are finitely axiomatizable by means of the substitution, detachment for material implication and Godel rules.
openaire   +2 more sources

Falsification-Aware Calculi and Semantics for Normal Modal Logics Including S4 and S5

Journal of Logic, Language and Information, 2022
N. Kamide
semanticscholar   +1 more source