Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,283,424 papers from all fields of science
Search
Sign In
Create Free Account
Normal modal logic
Known as:
S4 (logic)
, S4 (modal logic)
, S4 (normal modal logic)
In logic, a normal modal logic is a set L of modal formulas such that L contains: * All propositional tautologies; * All instances of the Kripke…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Accessibility relation
Admissible rule
Classical modal logic
De Morgan's laws
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Combining a novel feeding operator and recent advances to improve the fish school search
L. Verçosa
,
C. J. A. B. Filho
,
R. Monteiro
Latin American Conference on Computational…
2017
Corpus ID: 44220160
In this work, we propose a new version of Fish School Search Algorithm named FSS-CS. This release has three major changes. First…
Expand
2001
2001
Canonicity for Intensional Logics with Even Axioms
Timothy J. Surendonk
Journal of Symbolic Logic (JSL)
2001
Corpus ID: 14513991
Abstract This paper looks at the concept of neighborhood canonicity introduced by Brian Chellas [2]. We follow the lead of the…
Expand
1998
1998
Modal assurance criteria value for two orthogonal modal vectors
L. Rigner
1998
Corpus ID: 117372698
Clearly modal vectors are orthogonal over the mass matrix, assuming proportional damping. Two identical modal vectors (mass…
Expand
1995
1995
On variable separation in modal and superintuitionistic logics
L. Maksimova
Studia Logica: An International Journal for…
1995
Corpus ID: 2622527
In this paper we find an algebraic equivalent of the Hallden property in modal logics, namely, we prove that the Hallden…
Expand
1993
1993
Modal Sequents for Normal Modal Logics
C. Cerrato
Mathematical Logic Quarterly
1993
Corpus ID: 35061980
We present sequent calculi for normal modal logics where modal and propositional behaviours are separated, and we prove a cut…
Expand
1993
1993
Cut-free modal sequents for normal modal logics
C. Cerrato
Notre Dame J. Formal Log.
1993
Corpus ID: 5758020
We develop cut-free calculi of sequents for normal modal logics by using semantic modal sequents that are trees of usual sequents…
Expand
1991
1991
A note on the normal form of closed formulas of interpretability logic
P. Hájek
,
V. Svejdar
Studia Logica: An International Journal for…
1991
Corpus ID: 206777306
Each closed (i.e. variable free) formula of interpretability logic is equivalent in ILF to a closed formula of the provability…
Expand
1990
1990
Natural Deduction in Normal Modal Logic
J. Hawthorn
Notre Dame J. Formal Log.
1990
Corpus ID: 46164756
A natural deduction system for a wide range of normal modal logics is presented, which is based on Segerberg's idea that…
Expand
1990
1990
Destructive Modal Resolution
M. Fitting
Journal of Logic and Computation
1990
Corpus ID: 3255417
We present non-clausal resolution systems for propositional modal logics whose Kripke models do not involve symmetry, and for…
Expand
1984
1984
Epistemic arithmetic is a conservative extension of intuitionistic arithmetic
N. Goodman
Journal of Symbolic Logic (JSL)
1984
Corpus ID: 32726658
Questions about the constructive or effective character of particular arguments arise in several areas of classical mathematics…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE