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.

Version: v1 · 2026-09-28 · History
Domain-specific #: 11011
Domain group: Humanities
Origin domain: Philosophy
Subdomains: Modal Logic, Philosophical Logic → Philosophy

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 ). On the other hand, non-normal modal logics do not always have such requirements.

The minimal variant of non-normal modal logics is logic E, which contains the congruence rule in its Hilbert calculus or the E rule in its sequent calculus upon the corresponding proof systems for classical propositional logic. Additional axioms, namely axioms M, C and N, can be added to form stronger logic systems. With all three axioms added to logic E, a logic system equivalent to normal modal logic K is obtained.

For Non-normal modal logic, the abstraction is narrower than the article's general subject matter: a positive case must preserve A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in modal logic, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — Given any modal formula, the proving process with this resolution calculus is done by recursively renaming a complex modal formula as a propositional name and using the global modality to assert their equivalence.
Constitutive relation — For any modal formula \varphi , the formula \Diamond\varphi is defined by \neg\Box\neg\varphi.
Operating condition — 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.
Recognition evidence — Alternatively, the rule can be defined by \frac{A \leftrightarrow B}{\Diamond A \leftrightarrow \Diamond B}.
Admissible variation — The sequent calculus for logic E, another proof system that operates on sequents, consists of the inference rules for propositional logic and the E rule of inference: \frac{A \vdash B \qquad B \vdash A}{\Gamma, \Box A \vdash \Box B, \Delta}.
Characteristic consequence — For logic E, the resolution calculus consists of LRES, GRES, G2L, LERES and GERES rules.
Failure boundary — The syntax of non-normal modal logic systems resembles that of normal modal logics, which is founded upon propositional logic.

What It Is Not¶

Not the whole field of modal logic. The node requires the specific identity stated by A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics.
Not an over-broad reading. On the other hand, non-normal modal logics do not always have such requirements.
Not an over-broad reading. The syntax of non-normal modal logic systems resembles that of normal modal logics, which is founded upon propositional logic.
Not an over-broad reading. 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 ).
Not automatically Regular modal logic. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Non-normal modal logic applies literally inside modal logic wherever the source-defined carrier and relation can be established. Its documented habitats include:

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 ).
Syntax. The modalities are most commonly represented with the box ( \Box ) and the diamond ( \Diamond ).

Outside modal logic, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

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. The strongest recognition evidence in the frozen account is: Alternatively, the rule can be defined by \frac{A \leftrightarrow B}{\Diamond A \leftrightarrow \Diamond B}. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification On the other hand, non-normal modal logics do not always have such requirements. so that a reader can reproduce the classification rather than infer it from topical resemblance.

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. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

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. Alternatively, the rule can be defined by \frac{A \leftrightarrow B}{\Diamond A \leftrightarrow \Diamond B}.
Test variation. Change an implementation or setting while preserving the sequent calculus for logic E, another proof system that operates on sequents, consists of the inference rules for propositional logic and the E rule of inference: \frac{A \vdash B \qquad B \vdash A}{\Gamma, \Box A \vdash \Box B, \Delta}.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

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. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

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 ). This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics; recognition evidence → Alternatively, the rule can be defined by \frac{A \leftrightarrow B}{\Diamond A \leftrightarrow \Diamond B}

Applied / In Practice¶

Including all three axioms, the logic system is normal. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Additional axioms; invariant → A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics; boundary → the case exits the class when on the other hand, non-normal modal logics do not always have such requirements

Structural Tensions¶

T1 — Stable identity versus admissible variation. On the other hand, non-normal modal logics do not always have such requirements. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. The syntax of non-normal modal logic systems resembles that of normal modal logics, which is founded upon propositional logic. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. 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 ). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. The modalities are most commonly represented with the box ( \Box ) and the diamond ( \Diamond ). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. Given any modal formula, the proving process with this resolution calculus is done by recursively renaming a complex modal formula as a propositional name and using the global modality to assert their equivalence. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Non-normal modal logic literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. For any modal formula \varphi , the formula \Diamond\varphi is defined by \neg\Box\neg\varphi. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Non-normal modal logic distinguish that the broader parent Pattern leaves together?

Structural–Framed Character¶

Non-normal modal logic is mixed or framed-leaning. Its structural side is the repeatable organization summarized by A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics. Its framed side is the modal logic vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: 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. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Given any modal formula, the proving process with this resolution calculus is done by recursively renaming a complex modal formula as a propositional name and using the global modality to assert their equivalence. For any modal formula \varphi , the formula \Diamond\varphi is defined by \neg\Box\neg\varphi. It further constrains recognition and variation through: 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. Alternatively, the rule can be defined by \frac{A \leftrightarrow B}{\Diamond A \leftrightarrow \Diamond B}.

What is domain-bound. modal logic supplies the operative entities, technical vocabulary, warrants, and exceptions that make Non-normal modal logic literal. Its documented scope includes the condition that \mathcal{N}: \mathcal{W} \to \mathcal{PP}(\mathcal{W}) is the neighbourhood function that maps any world to a set of worlds. Another bounded application condition is that \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. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—The sequent calculus for logic E, another proof system that operates on sequents, consists of the inference rules for propositional logic and the E rule of inference: \frac{A \vdash B \qquad B \vdash A}{\Gamma, \Box A \vdash \Box B, \Delta}.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Formal System.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Non-normal modal logic. The reviewed identity is: A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

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

Show alternative path (1)

Neighborhood in Abstraction Space¶

Non-normal modal logic sits in a moderately populated region (44^th 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

Not to Be Confused With¶

Pattern. The parent omits the specialist differentia. Tell: Can the case establish A non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics?
Regular modal logic. A classical modal logic closed under a rule lifting conjunction-preserving implication through necessity and containing the duality of necessity and possibility. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Classical Modal Logic. A class of modal logics with dual necessity and possibility operators and replacement of logical equivalents under the modal operator, including the minimal non-normal system E and stronger regular and normal subclasses. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Modal algebra. A Boolean algebra equipped with a unary normal meet-preserving modal operator, providing algebraic semantics for normal propositional modal logics. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Non-normal modal logic remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside modal logic lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Non-normal_modal_logic (revision 1331413284).
Preserved source candidate: https://plato.stanford.edu/entries/logic-modal/
Preserved source candidate: https://hal.science/hal-03159954/
Preserved source candidate: https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/modalities-and-quantification/9BCD64F045217C2B13A02277F0FFBB9E
Preserved source candidate: https://link.springer.com/book/10.1007/978-3-319-67149-9
Preserved source candidate: https://www.theses.fr/2020AIXM0314.pdf
Preserved source candidate: https://hal.archives-ouvertes.fr/hal-02076639

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.