Papers
Topics
Authors
Recent
Search
2000 character limit reached

Kuznetsov-Muravitsky Isomorphism in Modal Logic

Updated 20 November 2025
  • The paper establishes that mutually inverse, meet- and join-preserving translation maps create a complete lattice isomorphism between normal extensions of KM and GL.
  • Kuznetsov-Muravitsky Isomorphism is defined by translating intuitionistic modal formulas into classical ones, ensuring preservation of properties like Kripke completeness and the finite model property.
  • The framework employs KM algebras, duality between modal Heyting algebras and Esakia spaces, and pre-filtration techniques to underpin robust algebraic and rule-rewriting strategies.

The Kuznetsov-Muravitsky Isomorphism establishes a precise lattice-theoretic and algebraic correspondence between normal extensions of intuitionistic modal logic KM\mathsf{KM} and those of classical provability logic GL\mathsf{GL}. At its core, the isomorphism reveals that the landscape of strong modal logics over intuitionistic and classical frameworks is tightly connected through specific translation procedures and algebraic enrichments. Its significance is further amplified by canonical rule systems, duality theory for modal (Heyting) algebras, and its ability to preserve key model-theoretic properties such as Kripke completeness and the finite model property (Bezhanishvili et al., 13 Nov 2025, Jibladze et al., 2024).

1. Precisely Formulated Isomorphism and Companion Translations

The primary result, the Kuznetsov-Muravitsky Isomorphism, asserts the existence of mutually inverse, meet- and join-preserving maps

σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})

that yield a complete lattice isomorphism between the normal extension lattices of KM\mathsf{KM} and GL\mathsf{GL}: σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}). In concrete terms, the translation TT maps each intuitionistic modal formula to a classical one by sending \boxtimes to \square and intuitionistic implication to a composed modal operator +\square^+. The maps

GL\mathsf{GL}0

establish the explicit isomorphism at the level of normal logic extensions (Bezhanishvili et al., 13 Nov 2025).

2. Algebraic Foundations: Kuznetsov-Muravitsky Algebras

A Kuznetsov-Muravitsky (KM) algebra consists of a Heyting algebra GL\mathsf{GL}1 equipped with an additional unary operation GL\mathsf{GL}2 subject to:

  • (KM1) GL\mathsf{GL}3,
  • (KM2) GL\mathsf{GL}4,
  • (KM3) GL\mathsf{GL}5, for all GL\mathsf{GL}6. Equivalently, for every GL\mathsf{GL}7, the filter GL\mathsf{GL}8 is principal, and GL\mathsf{GL}9 is its least element (Jibladze et al., 2024). These axioms characterize the enrichment of Heyting algebras for intuitionistic modal logics.

The one-step enrichment σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})0, defined for any Heyting algebra σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})1 and σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})2, produces a new algebra containing a canonical element σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})3 and a homomorphic image σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})4 of σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})5 that is isomorphic to σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})6. Repeated application of the enrichment across all elements yields a KM-algebra σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})7 into which σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})8 embeds, and σ ⁣:NExt(KM)NExt(GL),ρ ⁣:NExt(GL)NExt(KM)\sigma\colon \mathsf{NExt}(\mathsf{KM}) \longrightarrow \mathsf{NExt}(\mathsf{GL}), \qquad \rho\colon \mathsf{NExt}(\mathsf{GL}) \longrightarrow \mathsf{NExt}(\mathsf{KM})9 lies in the variety generated by KM\mathsf{KM}0 (Jibladze et al., 2024).

3. Pre-filtration and Pre-stable Canonical Rules

Pre-filtration provides an algebraic mechanism for extracting finite models and rules from possibly infinite structures. Given a fronton algebra KM\mathsf{KM}1 (algebraic semantics for KM\mathsf{KM}2), a valuation KM\mathsf{KM}3, and a finite subformula-closed set KM\mathsf{KM}4, a pre-filtration is a finite fronton KM\mathsf{KM}5 (with associated valuation KM\mathsf{KM}6) such that:

  • The KM\mathsf{KM}7-reduct of KM\mathsf{KM}8 is isomorphic to the finite distributive sublattice generated by KM\mathsf{KM}9,
  • GL\mathsf{GL}0 for GL\mathsf{GL}1,
  • The inclusion GL\mathsf{GL}2 is a pre-stable embedding for implications and modalities on GL\mathsf{GL}3.

Associated with such filtrations are pre-stable canonical rules. Given a finite fronton GL\mathsf{GL}4 and domains GL\mathsf{GL}5, GL\mathsf{GL}6, the canonical rule encodes the algebraic behavior of GL\mathsf{GL}7 and its modal operations. These are central in deriving the finite basis of the logic and in providing the means to translate between intuitionistic and classical rule systems (Bezhanishvili et al., 13 Nov 2025).

4. Duality Between Modal Heyting Algebras and Order-topological Spaces

The duality underpinning the isomorphism generalizes Stone duality to modal-logical settings:

  • A frontal Heyting algebra (for GL\mathsf{GL}8 and GL\mathsf{GL}9) is dual to a modalized Esakia space: a Stone space with relations σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).0 satisfying specific continuity and clone-Esakia conditions.
  • Normal extensions of σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).1 or σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).2 correspond via duality to (possibly universal) classes of σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).3- or Magari-algebras and are dual to modal spaces (Stone spaces with a single binary relation σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).4).

Homomorphisms between algebras correspond to continuous bounded morphisms between spaces. The geometric back-and-forth (bounded-domain) conditions translate directly to the boundedness properties of pre-stable embeddings and surjections, ensuring the duality is fully categorical (Bezhanishvili et al., 13 Nov 2025).

5. Proof Strategy and the Role of Rule-rewriting

The proof of the isomorphism proceeds through several key steps:

  • Rule-rewriting: Any rule in the σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).5 language is equivalent, over σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).6, to finitely many pre-stable canonical rules that arise from finite frontons via pre-filtration.
  • Duality and refutation: By Stone–Esakia duality, refutation of a canonical rule in a fronton algebra corresponds to the existence of a surjective bounded morphism onto its dual, respecting the necessary back-and-forth constraints.
  • Monomodal Companion and Translation: Translation σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).7 ensures that refutability of intuitionistic rules corresponds exactly to refutability of their classical companions, due to the interpretation of implication as the composed modal operator σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).8.
  • Skeletal Generation: Every universal class of σ=ρ1:NExt(KM)NExt(GL).\sigma = \rho^{-1}: \mathsf{NExt}(\mathsf{KM}) \cong \mathsf{NExt}(\mathsf{GL}).9–algebras is generated by algebras of the form TT0, where TT1 is a frontal Heyting algebra. This structural step guarantees that every extension of TT2 arises via intersection with the image of TT3.
  • Assembly: The embedding provided by TT4 is complete at the lattice level, and the argument via inverse translation ensures the correspondence is indeed an isomorphism (Bezhanishvili et al., 13 Nov 2025).

6. Preservation Properties and Universal Consequences

The isomorphism preserves important logical and model-theoretic properties, as well as providing algebraic insights:

Property Preserved under Isomorphism (Yes/No) Notes
Kripke completeness Yes TT5 is Kripke complete TT6 TT7 is complete for transitive frames
Finite model property (FMP) Yes FMP over intuitionistic frames maps to FMP over finite transitive classical frames
Conservative extension Yes Each TT8 extension is a conservative extension of its superintuitionistic base

Additionally, every Heyting algebra embeds into a KM-algebra generating the same variety, yielding a “canonical and functorial” enrichment and underpinning the statement that every variety of Heyting algebras is generated by reducts of KM-algebras (Jibladze et al., 2024). This relationship is central for universal algebraic and logical classification.

7. Central Lemmas and Theorems

The theoretical framework supporting the isomorphism is built on the following results:

  • Pre-stable duality: Homomorphisms and their duals correspond precisely under the bounded-domain/back-and-forth paradigm.
  • Rule-rewriting theorem: Every single-conclusion TT9 rule is equivalent to a finite pre-stable canonical rule set.
  • Translation and refutation lemma: For classicizable pre-stable canonical rules, refutability is preserved under the companion translation \boxtimes0.
  • Skeletal generation theorem: Every universal class of \boxtimes1-algebras is generated by images of frontal Heyting algebras.

Together these show that the companion translations \boxtimes2 and \boxtimes3 are mutual inverses and that the isomorphism is robust across both logical and algebraic formalisms (Bezhanishvili et al., 13 Nov 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (2)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Kuznetsov-Muravitsky Isomorphism.