Non-normal modal logic¶
A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics.
Core Idea¶
Non-normal modal logic is treated here as the recurring modal logic identity summarized by this source-grounded definition: A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics. A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics. Normal modal logics adhere to the distributivity axiom ( \Box (p \to q) \to (\Box p \to \Box q) ) and the necessitation principle which states that "a tautology must be necessarily true" ( \vdash A entails \vdash \Box A ).
Scope of Application¶
-
Semantics. \mathcal{N}: \mathcal{W} \to \mathcal{PP}(\mathcal{W}) is the neighbourhood function that maps any world to a set of worlds.
-
Semantics. \mathcal{V}: Atm \to \mathcal{P}(\mathcal{W}) is the valuation function which, given any propositional name p , outputs a set of worlds where p is true.
-
Semantics. The function \mathcal{P} denotes a power set.
-
Syntax. The syntax of non-normal modal logic systems resembles that of normal modal logics, which is founded upon propositional logic.
-
Syntax. An atomic statement is represented with propositional variables (e.g., p, q, r ); logical connectives include negation ( \neg ), conjunction ( \land ), disjunction ( \lor ) and implication ( \to ).
Clarity¶
A clear use of Non-normal modal logic names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics.
Manages Complexity¶
Non-normal modal logic compresses multiple modal logic details into a stable diagnostic relation. The source shows both the central mechanism—for any modal formula \varphi , the formula \Diamond\varphi is defined by \neg\Box\neg\varphi .—and the practical consequence—for logic E, the resolution calculus consists of LRES, GRES, G2L, LERES and GERES rules. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit.
Abstract Reasoning¶
- Type the carrier. Identify the modal logic entities to which the claim applies.
- State the relation. Use the source-grounded identity: A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics.
- Check operation and conditions. Alternatively, if the language is first defined with the diamond, then the box can be analogously defined by \Box\varphi \equiv \neg\Diamond\neg\varphi.
- Demand recognition evidence.
Knowledge Transfer¶
Within the home domain. Knowledge about Non-normal modal logic transfers literally when a new case preserves the same carrier type, relation, and recognition test. \mathcal{N}: \mathcal{W} \to \mathcal{PP}(\mathcal{W}) is the neighbourhood function that maps any world to a set of worlds. \mathcal{V}: Atm \to \mathcal{P}(\mathcal{W}) is the valuation function which, given any propositional name p , outputs a set of worlds where p is true. Beyond the home domain. No canonical parent is asserted for Non-normal modal logic.
Relationships to Other Abstractions¶
Current abstraction Non-normal modal logic Domain-specific
Parents (1) — more general patterns this builds on
-
Non-normal modal logic is a kind of Formal System Prime
A non-normal modal logic is a formal system distinguished by which normal-modal principles it declines; it is not a kind of Omega-logic.
Hierarchy paths (2) — routes to 2 parentless roots
- Non-normal modal logic → Formal System → Formalization → Representation → Abstraction
- Non-normal modal logic → Formal System → Formalization → Transformation → Function (Mapping)
Neighborhood in Abstraction Space¶
Non-normal modal logic sits in a moderately populated region (44th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Formal Logic & Language Constructs (20 abstractions)
Nearest neighbors
- Typographical Number Theory — 0.88
- Universal generalization — 0.88
- Valuation (logic) — 0.87
- Kripke–Platek set theory with urelements — 0.86
- Existential Instantiation — 0.86
Computed from structural-signature embeddings · 2026-10-08