There is a close relationship between this debate and a common criticism that standard formal logics (in the sense of (L1)) won't be able to capture the logical truths (in the sense of (L2)).
Thus the term "logical" has a broad sense that includes not only formal but also informal logics, in which strength depends on the interrelated meanings of terms and background information that resists complete formalization: induction, analogy, narrative, and so on.
A similar approach was introduced for modal logics in Kripke 1963.
The earliest paraconsistent logics in the contemporary era seem to have been given by two Russians.
These theories are explained, and compared to other nonmonotonic logics, in Meyer & van der Hoek 1995.
The development of paraconsistent logics (in the form of relevant logics) was transported to Australia.
Finally, four empirically grounded configurations of organizing logics in project businesses are synthesized.
So the presence of axiom (M) distinguishes logics for necessity from other logics in the modal family.
Temporal logics are now the chief logics in theoretical computer science and have a close connection with logics of programs.
Then we will explain how the same strategy may be adapted to other logics in the modal family.
Other applications of temporal logics in computer science include: temporal databases, real-time processes and systems, hardware verification, etc.
