💻 computer science

Positive Instantial Neighbourhood logic

This paper introduces Positive Instantial Neighbourhood Logic (PINL), a negation-free modal system with independent box and diamond modalities, and establishes its completeness via persistent neighbourhood semantics, algebraic semantics using 2-DLIos, and a canonical bitopological representation.

Original authors: Litan Kumar Das, Anupam Khanra, Sujit Kumar Sardar

Published 2026-06-09✓ Author reviewed ⓘ

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Litan Kumar Das, Anupam Khanra, Sujit Kumar Sardar

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 by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a detective trying to understand a mysterious city called World. In this city, every person (or "world") has a personal Neighborhood.

In traditional logic, a detective might ask: "Does everyone in this neighborhood follow the rules?" or "Is there at least one person here who broke the rules?"

This paper introduces a new, more detailed way of investigating these neighborhoods, called Positive Instantial Neighbourhood Logic (PINL). Here is how it works, broken down into simple concepts:

1. The "No Negation" Rule (The Positive Twist)

Usually, detectives use "No" and "Not" to solve cases. For example, "It is not the case that everyone is innocent."
However, this paper decides to ban the word "No." The detectives can only say what is true, not what isn't.

The Analogy: Imagine you are describing a fruit basket. You can say, "There is an apple," or "There is a banana." But you cannot say, "There is no orange." You can only describe what is actually present.
The Result: Because they can't use "No," the two main tools of the detective—the Box (which checks if everyone in a group does something) and the Diamond (which checks if someone in a group does something)—become two completely separate tools. They can't be used to define each other anymore.

2. The Two Special Tools: The Box and The Diamond

In this new logic, the detectives use two special lenses to look at a neighborhood:

The Box Lens (□): This lens asks, "Is there a specific group of people in this neighborhood where everyone follows the main rule, and specific individuals are also present to prove they exist?"
- Example: "Is there a group of people where everyone is wearing a hat (the main rule), and specifically, there is a tall person and a short person in that group?"
The Diamond Lens (♢): This lens asks, "Is it true that for every possible group we could pick, either the group is entirely made of people who break a specific rule, OR the group contains at least one person who follows the main rule?"
- Example: "No matter which group of people you pick, either they are all liars, or at least one of them is telling the truth."

3. The Problem with the "Standard" Map

The authors tried to build a perfect map (a "canonical model") of this city using these rules. But they hit a snag.

The Glitch: In the standard map, neighborhoods are just unlabeled lists of people. If a list of people fits the description for the "Box" tool, the map might accidentally use that same list to satisfy the "Diamond" tool, even if it shouldn't. It's like using a photo of a "Tall Person" to prove a "Short Person" exists just because they are in the same picture.
The Fix: To solve this, the authors created a Typed Map. Instead of just a list of people, every neighborhood on the map comes with a Label.
- The Analogy: Imagine every group of people in the city has a name tag. One group is labeled "Group for the Box Tool," and another is labeled "Group for the Diamond Tool." This prevents the detective from getting confused and using the wrong group for the wrong job.

4. The Algebraic "Recipe Book"

The paper also translates these logical rules into a mathematical "Recipe Book" called a 2-DLIO.

Think of this as a cookbook where the ingredients are logical statements.
The book has two sets of instructions (recipes): one set for the Box ingredients and one set for the Diamond ingredients.
The authors proved that if you follow the rules of their logic (PINL), you are essentially following the rules of this specific Recipe Book. They showed that the "Lindenbaum Algebra" (which is just a fancy way of saying "the collection of all possible logical recipes") fits perfectly into this book.

5. The Final Map: The Bitopological City

Finally, the authors built a grand, final version of the city map called a Bitopological Space.

This map has two layers of geography:
1. A Positive Layer (showing where things are).
2. A Negative Layer (showing where things are not, but described without using the word "No"—instead, it describes the "counter-theory" or the list of things that failed).
The Big Achievement: They proved that the "Recipe Book" (the algebra) and this "Two-Layer City Map" (the topology) are actually the same thing, just viewed from different angles. If you know the recipes, you can build the city, and if you look at the city, you can read the recipes.

Summary

This paper creates a new, "No-Negation" version of a logic system for neighborhoods. It solves a tricky problem where the two main tools (Box and Diamond) get confused by building a labeled, "typed" map. It then proves that this logic system is mathematically sound by showing it perfectly matches a specific type of algebraic recipe book and a two-layered city map.

What the paper does NOT do:

It does not apply this to real-world computer systems, medical diagnoses, or legal cases.
It does not claim to solve the "duality" problem completely (it calls this a "first step" toward a future theory).
It does not combine the Box and Diamond tools into a single tool; it keeps them separate for now.

Technical Summary: Positive Instantial Neighbourhood Logic (PINL)

Problem Statement
Instantial Neighbourhood Logic (INL) is a modal language designed for neighbourhood frames, allowing formulas to express not only universal scope conditions but also existential information about specific "kinds of worlds" (instances) occurring within a neighbourhood. While classical INL and its coalgebraic duality (involving Boolean Algebras with Instantial Operators, or BAIOs) are well-developed, there exists a gap in the literature regarding a systematic, positive (negation-free) version of this logic.

The absence of classical negation in positive logic prevents the interdefinability of box ( $\Box$ ) and diamond ( $\Diamond$ ) operators. Consequently, a positive version of INL cannot be treated merely as a fragment of classical INL; it requires a distinct proof system, a suitable positive neighbourhood semantics, an algebraic semantics based on distributive lattices, and a canonical representation. The paper addresses the lack of these foundational components for a positive, two-sided instantial neighbourhood logic.

Methodology
The authors develop the logic, denoted as Positive Instantial Neighbourhood Logic (PINL), through a multi-faceted approach combining proof theory, model theory, algebra, and topology:

Syntax and Proof System: The language of PINL is constructed over a propositional base of bounded distributive lattices (using $\top, \bot, \land, \lor$ ) rather than classical propositional logic. It introduces two primitive, independent instantial modalities: a box-type $\Box(\phi_1, \dots, \phi_n; \psi)$ and a diamond-type $\Diamond(\phi_1, \dots, \phi_n; \psi)$ . A sequent-based proof system is formulated with axioms for bounded distributive lattices and specific modal axioms for $\Box$ and $\Diamond$ that reflect their independent nature.
Semantics (Persistent Two-Sided Models): The logic is interpreted over persistent two-sided neighbourhood models. These structures consist of a partially ordered set $(W, \leq)$ and two neighbourhood functions, $N_\Box$ and $N_\Diamond$ , mapping worlds to sets of upsets. Crucially, $N_\Box$ is monotone upward (preserving order), while $N_\Diamond$ is monotone downward. Truth is defined via witness conditions for $\Box$ (existence of a neighbourhood satisfying scope and instance formulas) and co-witness conditions for $\Diamond$ (universal satisfaction of a disjunction of conditions).
Canonical Construction and Typed Semantics: A direct canonical completeness proof for the standard persistent semantics is obstructed by the extensional nature of neighbourhoods (unlabelled upsets may accidentally witness multiple formulas). To overcome this, the authors introduce an auxiliary typed persistent neighbourhood semantics. In this setting, neighbourhoods are labelled by the specific modal formulas they are intended to witness or refute. The canonical model is built from prime theory pairs $(a_1, a_2)$ , where $a_1$ is a theory and $a_2$ is a counter-theory. A Truth Lemma is established for this typed model, proving that semantic truth coincides with membership in the positive component of the prime pair.
Algebraic Semantics (2-DLIOs): The paper introduces 2-DLIOs (bounded distributive lattices equipped with two families of instantial operations, $(f_n)$ for $\Box$ and $(g_n)$ for $\Diamond$ ) as the algebraic counterpart. The Lindenbaum algebra of PINL is shown to be a 2-DLIO.
Bitopological Representation: The authors construct a canonical bitopological PINL-space derived from the prime theory pairs. This space is equipped with two topologies ( $\tau_+$ generated by positive membership sets $U_\phi$ and $\tau_-$ generated by negative membership sets $V_\phi$ ). The algebra of admissible positive opens in this space is shown to be isomorphic to the Lindenbaum 2-DLIO.

Key Contributions and Results

Formal System: Definition of the language and a complete proof system for PINL, treating $\Box$ and $\Diamond$ as independent primitives with distinct axiom schemes.
Completeness: Proof of soundness and completeness of PINL with respect to persistent two-sided neighbourhood models. This is achieved via the auxiliary typed semantics, which resolves the technical difficulties of the canonical construction in the absence of negation.
Algebraic Characterization: Introduction of 2-DLIOs as the algebraic semantics for PINL. The paper proves algebraic soundness and completeness, demonstrating that the Lindenbaum algebra of PINL is a 2-DLIO.
Canonical Representation: Construction of the canonical bitopological PINL-space. The paper proves that the algebra of admissible positive opens of this space is isomorphic to the Lindenbaum 2-DLIO. This provides a canonical admissible-open representation of the logic.
Separation of Concerns: The work explicitly isolates the positive, independent-operator fragment of INL, distinguishing it from the classical Boolean framework and the full DLIO framework where interaction axioms might exist.

Significance and Scope
The paper claims to provide the first systematic development of a positive, negation-free version of instantial neighbourhood logic. It fills a specific gap in the literature by establishing the proof system, semantics, and algebraic foundations for this logic.

The authors explicitly state that the scope is limited to a canonical representation theorem, not a full categorical duality theorem. While the work lays the groundwork for a future duality theory (specifically a Priestley-style or bitopological duality for 2-DLIOs), the current paper does not define the necessary category of descriptive PINL-spaces, morphisms, or functorial treatments. Similarly, the paper notes that a "geometric" version of INL (involving Scott-continuity) is suggested by the literature but is left for future work.

The significance lies in bridging positive modal logic, neighbourhood semantics, and distributive lattice theory, offering a rigorous framework for reasoning about instantial properties without classical negation, and providing the necessary algebraic and topological tools for future duality research.