🔢 mathematics

Possibly Relevant Translations

This paper develops translations from relevant logics into normal modal logics to clarify their structural connections, derive corollary results, and propose questions for future research.

Original authors: Søren Brinck Knudstorp

Published 2026-07-01

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Søren Brinck Knudstorp

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a translator trying to bridge two very different cities. One city is Relevant Logic, where every statement must be strictly connected to the one before it (like a conversation where you can't just say "The sky is blue" unless it relates to the previous topic). The other city is Modal Logic, a more flexible place where statements can float around and connect in broader, more abstract ways.

For a long time, these two cities spoke different languages. This paper, written by Søren Brinck Knudstorp, is like a new, highly sophisticated dictionary and a set of maps that allow people from both cities to understand each other perfectly.

Here is a breakdown of what the paper does, using everyday analogies:

1. The Problem: Two Different Architectures

Think of Relevant Logic as a building with a strict rule: every room must be connected by a hallway. You can't have a room floating in space; it must be linked to the one before it. This makes the building very sturdy but hard to navigate if you aren't used to the rules.

Modal Logic is like a building with a magical elevator. You can jump between floors easily, and the connections are looser.

The author asks: Can we translate the strict rules of the "Relevant" building into the language of the "Modal" building without losing any meaning?

2. The First Attempt: A Basic Dictionary (The "Star" Translation)

The author starts by creating a simple translation tool (called the $\star$ -translation).

How it works: It takes a sentence from the Relevant city and rewrites it in the Modal city's language.
The Result: For simple sentences, it works perfectly. If a sentence is true in the Relevant city, its translation is true in the Modal city, and vice versa.
The Catch: This dictionary only works well for the "basics" (like "and," "or," and simple "if-then" statements). It starts to stumble when the sentences get complicated, specifically when you have "if-then" statements nested inside other "if-then" statements (like a Russian nesting doll).

3. The Second Attempt: A Deeper Dictionary (The "Nested" Translation)

To fix the nesting problem, the author creates a second, more complex translation (called the $*$ -translation).

The Analogy: Imagine the first dictionary was for single words. This new one is for entire paragraphs. It adds a special "wrapper" around complex sentences to ensure the strict rules of the Relevant city are respected even when they are deep inside the Modal city's structure.
The Result: This creates a perfect bridge for the basic version of Relevant Logic. It proves that the Relevant city is actually just a special, stricter section of the Modal city.

4. The Limitation: The "Missing Elevator"

The author discovers that this perfect translation breaks down when trying to translate the stronger versions of Relevant Logic (like the famous system R).

The Metaphor: The Relevant city has a special rule called "Contraction" (which is like saying, "If I need to use this key twice, I can just use it once"). The Modal city doesn't naturally have this rule. When the author tries to translate this rule, the "elevator" in the Modal city fails to replicate the "hallway" logic of the Relevant city.
The Consequence: The translation works for some weaker Relevant logics but fails for the strongest ones. The author admits that while they made a great start, they haven't found a way to translate everything yet.

5. The Master Key: Adding "Truth" and "Fusion"

In the second half of the paper, the author adds more tools to the translation kit.

New Tools: They introduce a "Truth Constant" (a special button that always means "True") and a "Fusion" operator (a way to glue two ideas together).
The Breakthrough: By adding these specific tools to the Modal city's language, the author builds a Master Key.
The Result: With this Master Key, they can now translate any sentence from the Relevant city (including the tricky ones with negation and fusion) into the Modal city. It turns out that if you build the Modal city with these specific extra rules, it becomes an exact copy of the Relevant city.

6. Why This Matters (The "What We Learned" Part)

The paper doesn't just translate words; it proves that these two logical systems are structurally identical when you look at them the right way.

Decidability: Because we can translate Relevant Logic into Modal Logic, we can use the known tools of Modal Logic to solve problems in Relevant Logic. For example, the author shows that because the Modal version of certain systems is impossible to solve (undecidable), the Relevant versions must be impossible to solve too.
Interpolation: The author raises a question about "interpolation" (finding a middle-ground statement between two others). Since the translation works, we can now use the knowledge of the Modal city to guess whether the Relevant city has this property.

Summary

The paper is a successful attempt to build a Rosetta Stone between two logical traditions.

It starts with a simple dictionary that works for basic sentences.
It refines the dictionary to handle complex, nested sentences.
It admits that the first dictionary fails for the strongest versions of the language.
Finally, it builds a Master Key by adding specific "Truth" and "Fusion" tools, proving that the entire Relevant Logic system can be perfectly mapped onto a specific version of Modal Logic.

The author concludes that while they haven't solved every single puzzle (some questions remain for future work), they have successfully shown that these two logical worlds are much closer neighbors than anyone previously realized.

Technical Summary: Possibly Relevant Translations

Problem and Motivation
The paper addresses the structural relationship between relevant logics (specifically the Anderson–Belnap lineage) and normal modal logics. While the translation of intuitionistic logic into classical modal logic (via the Gödel–McKinsey–Tarski translation) has historically fostered significant cross-tradition exchange, a comparable, systematic translation between relevant and modal logics remains underdeveloped. The author aims to establish full and faithful translations from relevant logics into normal modal logics to clarify structural connections, derive corollary results, and identify limitations in current translational approaches. The work focuses initially on the positive fragment $\{\land, \lor, \to\}$ and gradually extends to include the truth constant $t$ , fusion $\circ$ , and negation $\neg$ .

Methodology
The paper employs a semantic approach, utilizing model transformations between two distinct frameworks:

Routley–Meyer Frames: The standard semantics for relevant logics, defined as triples $(K, R, N)$ where $R$ is a ternary relation and $N$ is a set of normal points, subject to specific order and relational constraints (e.g., the "down-down-up" condition).
Kripke Frames: The standard semantics for normal modal logics, defined as pairs $(W, R)$ (or tuples with additional relations for extended languages).

The core methodology involves defining a translation function (denoted $\star$ , $\ast$ , or $\circ$ ) from relevant formulas to modal formulas. To prove that these translations are full (if a relevant implication holds, the modal translation holds) and faithful (if the modal translation holds, the relevant implication holds), the author constructs two model transformations:

$F$ : Maps pointed Kripke models to pointed Routley–Meyer models.
$G$ : Maps pointed Routley–Meyer models to pointed Kripke models.

These transformations are designed to satisfy adjunction patterns where satisfaction in one model corresponds to satisfaction of the translated formula in the other. The paper also utilizes correspondence theory (specifically Sahlqvist correspondence) to identify the frame conditions in Kripke semantics that correspond to specific relevant axioms.

Key Contributions and Results

Basic Positive Translation ( $\star$ ):
- The author defines a translation $\star$ for the $\{\land, \lor, \to\}$ fragment where $\to$ is mapped to a defined modal operator $\neg \Diamond(\cdot, \neg \cdot)$ .
- Theorem 1.4: Establishes that for the basic relevant logic $B^+$ and the basic binary modal logic $K_2$ , $\vdash_{B^+} \phi \to \psi$ iff $\vdash_{K_2} \phi^\star \supset \psi^\star$ .
- Extension to Stronger Logics: The translation extends to logics axiomatized by subsets of axioms 7–10 (e.g., $TW^+$ , $TWJ^+$ , $C^+$ ). However, the paper demonstrates that this translation fails for logics requiring contraction (axiom 11) or assertion (axiom 12), such as $R^+$ . The failure arises because the simpler Kripke semantics lack the specific order conditions (like the "down-down-up" property) inherent in Routley–Meyer frames that are necessary to validate these axioms.
Nested Implication Translation ( $\ast$ ):
- To address formulas where the main connective is not $\to$ , a second translation $\ast$ is introduced, mapping $\phi \to \psi$ to $\Box_\to(\phi^\star \supset \psi^\star)$ .
- Theorem 1.7: Shows that $\ast$ provides a full and faithful embedding of $B^+$ into $K_2$ for all positive formulas, realizing $B^+$ as a syntactic fragment of $K_2$ .
- Like the $\star$ -translation, this approach also encounters limitations when extended to logics involving contraction and assertion.
Undecidability and Interpolation:
- The paper transfers undecidability results from relevant logics to modal logics. Specifically, it proves that the modal logics corresponding to the frame conditions of $TWJ^+$ and $C^+$ are undecidable (Theorem 1.9), supplementing existing results by Urquhart and others.
- The author raises open questions regarding the Craig Interpolation Property (CIP). While $K_2$ has CIP, it is unknown whether $B^+$ does. The translation suggests that if $B^+$ lacks CIP, it might be due to the specific behavior of the translation or the lack of certain vocabulary.
Extended Translations ( $\circ$ ):
- To overcome the limitations of the previous translations regarding contraction and assertion, the paper introduces a translation into a richer modal language containing a nullary modality $t$ and a binary modality $\circ$ .
- Definition 2.2: Defines Modal $B^+$ ( $Mod.B^+$ ) as the least normal modal logic containing residuation axioms and axioms corresponding to Routley–Meyer frame conditions (reflexivity, transitivity, upsets, etc.).
- Theorem 2.5: Demonstrates that for the language extended with $t$ and $\circ$ , the translation $\circ$ is full and faithful: $\vdash_B \phi$ iff $\vdash_{Mod.B^+} t \supset \phi^\circ$ . This translation successfully captures the structural constraints of Routley–Meyer frames (including the order relation $\leq$ ) within Kripke semantics.
- Theorem 2.8: Extends this result to the full language including negation $\neg$ by introducing a unary modality $\Box_\neg$ and corresponding frame conditions (involution and order-reversal).

Significance and Claims
The paper modestly claims to clarify structural connections between relevant and modal logics through a series of translations. Its primary significance lies in:

Providing a full and faithful translation of the basic relevant logic $B$ (and its extensions with $t, \circ, \neg$ ) into a specific normal modal logic ($Mod.B$), thereby realizing relevant logic as a syntactic fragment of modal logic.
Highlighting the limitations of simpler translations (like $\star$ ) when applied to stronger relevant logics (like $R^+$ ), specifically noting that standard Kripke frames cannot capture the necessary order-theoretic properties of Routley–Meyer frames without additional axioms or modalities.
Facilitating the transfer of meta-logical properties, such as decidability and undecidability, between the two traditions.
Identifying open questions for future work, particularly regarding the interpolation property in $B^+$ and the potential for deepening the structural connection to include frame-incomplete logics.

The author explicitly states that the paper is "exploratory and broad rather than deep," leaving a fuller analysis of philosophical motivations and deeper structural relations for future work.