Modal logic — is a type of formal logic that extends classical propositional and predicate logic to include operators expressing modality. Modals words that express modalities qualify a statement. For example, the statement John is happy might be qualified by… … Wikipedia
Classical modal logic — In modal logic, a classical modal logic L is any modal logic containing (as axiom or theorem) the duality of the modal operators which is also closed under the rule Alternatively one can give a dual definition of L by which L is classical iff it… … Wikipedia
Dynamic logic (modal logic) — For the subject in digital electronics also known as clocked logic, see dynamic logic (digital electronics). Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs and later applied to more general… … Wikipedia
Modal verb — A modal verb (also modal, modal auxiliary verb, modal auxiliary) is a type of auxiliary verb that is used to indicate modality that is, likelihood, ability, permission, and obligation.[1]:p.33 The use of auxiliary verbs to express modality is… … Wikipedia
Doxastic logic — is a modal logic concerned with reasoning about beliefs. The term doxastic derives from the ancient Greek δόξα, doxa, which means belief. Typically, a doxastic logic uses Bx to mean It is believed that x is the case, and the set denotes a set of… … Wikipedia
Multimodal logic — A multimodal logic is a modal logic that has more than one primitive modal operator. They find substantial applications in theoretical computer science. A modal logic with n primitive unary modal operators is called an n modal logic. Given these… … Wikipedia
Linear temporal logic — (LTL) is a modal temporal logic with modalities referring to time. In LTL, one can encode formulae about the future of paths such as that a condition will eventually be true, that a condition will be true until another fact becomes true,… … Wikipedia
Interior algebra — In abstract algebra, an interior algebra is a certain type of algebraic structure that encodes the idea of the topological interior of a set. Interior algebras are to topology and the modal logic S4 what Boolean algebras are to set theory and… … Wikipedia
Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… … Wikipedia
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … Wikipedia