arxiv: 2605.07898 · v1 · submitted 2026-05-08 · 🧮 math.LO

Recognition: no theorem link

On Many-logic modal structures and information-based logics

Ab\'ilio Rodrigues, Alfredo Freire, Manuel Martins, Marcelo Coniglio

Pith reviewed 2026-05-11 03:25 UTC · model grok-4.3

classification 🧮 math.LO

keywords many-logic modal structuresMLMSinformation-based logicsLET+Kdown-complete sublatticesbase latticeparaconsistent logicmodal logic

0 comments

The pith

Many-logic modal structures anchor different logics to one base lattice so accessibility relations can connect worlds whose semantics differ.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces many-logic modal structures to handle logics that arise from information. These structures fix each logic inside a shared base lattice by treating its semantics as a down-complete sublattice. This construction lets the same modal apparatus express how one information state leads to another even when the underlying logic changes. The method is worked out in detail for the six-valued logic LET+K and the four-, three-, and two-valued logics obtained from its sublattices. The resulting framework therefore covers paracomplete, paraconsistent, and classical reasoning inside one structure that tracks database configurations and their temporal evolution.

Core claim

Many-logic modal structures (MLMS) are defined by anchoring the semantics of each logic to a single base lattice in which every logic appears as a down-complete sublattice. This device makes it possible to define accessibility relations between worlds that operate under different logics while still representing the passage from one information state to the next. The construction is illustrated by taking the lattice L6 as base and recovering LET+K together with its four-, three-, and two-valued sublattices, thereby obtaining a uniform account of paracomplete, paraconsistent, and classical contexts in six-, four-, three-, and two-valued scenarios.

What carries the argument

Many-logic modal structures (MLMS) anchored to a base lattice whose down-complete sublattices supply the semantics of each participating logic.

If this is right

MLMS can place paracomplete, paraconsistent, and classical logics inside the same modal frame by using sublattices of L6.
Accessibility relations become definable between worlds whose underlying logics differ in strength or number of values.
Database configurations and the ways they evolve can be represented directly by the information states of the structure.
Six-, four-, three-, and two-valued scenarios are handled uniformly without switching formal systems.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same anchoring technique could be tried on lattices other than L6 to incorporate additional families of many-valued logics.
Dynamic database systems in which the governing logic itself changes with updates become natural objects of study inside MLMS.
Hybrid reasoning tools that combine classical and non-classical inference steps could be given a uniform modal semantics.
Formal models of information flow in distributed or uncertain environments gain a single language for both static and evolving states.

Load-bearing premise

The semantics of every logic under consideration, including LET+K and its sublattices, can be realized as down-complete sublattices of one common base lattice without destroying the intended accessibility relations or the representation of information-state change.

What would settle it

A concrete collection of logics for which no single lattice exists whose down-complete sublattices simultaneously recover the original truth tables, preserve the intended accessibility relations, and still allow the modal operators to track temporal transitions between information states.

read the original abstract

This paper proposes an approach to information-based logics using many-logic modal structures (MLMS). These structures can express accessibility relations between worlds with different underlying logics by anchoring them to a base lattice, which contains the semantics of each logic as a down-complete sublattice. MLMS are suitable for representing connections between information states (i.e., configurations of databases) and the evolution of information states over time. We will illustrate the application of MLMS by means of the six-valued logic of evidence and truth LET+K , related to the lattice L6, and some four-, three-, and two-valued logics related to down-complete sublattices of L6. These logics are capable of representing paracomplete, paraconsistent, and classical contexts with six-, four-, three-, and two-valued scenarios.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

MLMS provide a lattice-anchored way to mix logics in modal structures for information evolution, with a good example but limited formal verification shown.

read the letter

The key takeaway is that this paper introduces many-logic modal structures (MLMS) which embed multiple logics as down-complete sublattices of a single base lattice to handle modal accessibility across different logical systems and track information state evolution. The paper does a solid job presenting the application to LET+K and its sublattices. By using L6 as the base, it shows how six-valued evidence and truth logic can contain four-, three-, and two-valued logics for paraconsistent, paracomplete, and classical cases. This gives a unified way to model how information changes when the logic itself varies, which fits the database configuration example. The main limitation is that the provided text focuses on the proposal and illustration without including the detailed definitions or proofs for how the accessibility relations and information evolution are preserved under the embeddings. The assumption that the sublattice semantics carry over without issues is central, and while no contradictions appear in the outline, it would help to see explicit verification that the modal properties hold when crossing between logics. The stress-test confirms the stated properties are consistent, but that is not the same as a full check. This is for logicians in the area of non-classical modal logics and information-based systems. Someone already working with lattice semantics or LET+K would see the most direct use. I recommend sending it for peer review. The new framework is worth checking in detail even if the current version is mostly definitional.

Referee Report

2 major / 2 minor

Summary. The paper proposes many-logic modal structures (MLMS) as a framework for information-based logics. These structures anchor multiple logics to a single base lattice L6, representing the semantics of each logic (including LET+K and its sublattices) as down-complete sublattices. This construction is claimed to express accessibility relations between worlds governed by different logics and to model the evolution of information states over time, with illustrations for six-, four-, three-, and two-valued logics capturing paracomplete, paraconsistent, and classical contexts in database configurations.

Significance. If the lattice embeddings and accessibility relations are rigorously defined and verified, the framework could provide a unified lattice-theoretic approach to modal logics with heterogeneous truth-value sets, offering a tool for dynamic information-state modeling that is not available in standard single-logic Kripke structures. The explicit connection to database configurations and time evolution is a potentially useful application direction.

major comments (2)

[Definition of MLMS and application to LET+K] The central claim that MLMS preserve intended accessibility relations across logics rests on the down-complete sublattice embeddings into L6, but no explicit construction or verification of the accessibility relation (e.g., how worlds in different sublattices are related while respecting the lattice order) is supplied in the definitional sections; this is load-bearing for the suitability claim in the abstract.
[Illustration with LET+K and sublattices] The weakest assumption—that the semantics of LET+K and its sublattices can be represented as down-complete sublattices without distorting the modal accessibility or information-evolution properties—is stated but not demonstrated via any theorem, counter-example check, or explicit embedding map; without this, the framework remains a definitional proposal rather than a verified representation.

minor comments (2)

[Preliminaries] Notation for the base lattice L6 and the down-complete sublattices should be introduced with explicit order-theoretic definitions (e.g., what constitutes 'down-complete' in this context) before the application examples.
[Introduction] The abstract and introduction repeat the list of valued scenarios (six-, four-, three-, two-valued) without cross-referencing the corresponding sublattice constructions; a single summary table would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address the major comments point by point below, indicating the revisions we will undertake to strengthen the presentation of the framework.

read point-by-point responses

Referee: [Definition of MLMS and application to LET+K] The central claim that MLMS preserve intended accessibility relations across logics rests on the down-complete sublattice embeddings into L6, but no explicit construction or verification of the accessibility relation (e.g., how worlds in different sublattices are related while respecting the lattice order) is supplied in the definitional sections; this is load-bearing for the suitability claim in the abstract.

Authors: We agree that the preservation of accessibility relations is central and that the definitional sections do not include an explicit construction or verification of how worlds in different sublattices are related via the lattice order. The manuscript defines MLMS and the down-complete sublattices but leaves the cross-sublattice accessibility implicit. In the revised version we will add a dedicated subsection with an explicit construction of the accessibility relation induced by the order on L6, together with a theorem establishing that the relation is preserved under the embeddings. revision: yes
Referee: [Illustration with LET+K and sublattices] The weakest assumption—that the semantics of LET+K and its sublattices can be represented as down-complete sublattices without distorting the modal accessibility or information-evolution properties—is stated but not demonstrated via any theorem, counter-example check, or explicit embedding map; without this, the framework remains a definitional proposal rather than a verified representation.

Authors: The paper states that the semantics of LET+K and its sublattices are represented as down-complete sublattices of L6 and provides illustrative examples for six-, four-, three-, and two-valued cases, but we acknowledge that no general theorem, explicit embedding map, or systematic check for preservation of modal accessibility and information-evolution properties is supplied. We will revise by inserting an explicit embedding map for the relevant sublattices and a short theorem (with accompanying example verification) showing that the modal operators and information-state evolution remain undistorted under these embeddings. revision: yes

Circularity Check

0 steps flagged

No significant circularity; definitional framework with independent content

full rationale

The paper introduces MLMS as a proposed structure for linking information states across logics by anchoring them to a base lattice L6 containing down-complete sublattices for each logic's semantics. No equations, parameters, or quantitative predictions appear; the central claim is a definitional construction illustrated with LET+K and its sublattices rather than derived from fitted inputs or prior results by construction. No self-citation is shown to be load-bearing for the core proposal, and the weakest assumption (representability as sublattices preserving accessibility) is stated as part of the framework definition itself, not smuggled in or renamed from known results. The derivation chain is self-contained as a modeling approach without reduction to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on the definitional introduction of MLMS and the domain assumption that logics' semantics can be embedded as down-complete sublattices; no free parameters or independently evidenced invented entities are mentioned.

axioms (1)

domain assumption The semantics of each logic can be represented as a down-complete sublattice of a base lattice.
Invoked to allow anchoring of different logics inside MLMS.

invented entities (1)

Many-logic modal structures (MLMS) no independent evidence
purpose: To express accessibility relations between worlds that may have different underlying logics while modeling information-state evolution.
Newly defined structure whose suitability is asserted in the abstract.

pith-pipeline@v0.9.0 · 5432 in / 1378 out tokens · 54122 ms · 2026-05-11T03:25:33.338369+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

[1]

Anderson and N.D

A.R. Anderson and N.D. Belnap. First degree entailments. Mathematische Annalen, 149: 0 302--319, 1963

work page 1963
[2]

N. Belnap. How a computer should think. In G. Ryle, editor, Contemporary A spects of P hilosophy . Oriel Press, 1977. Reprinted in New Essays on Belnap-Dunn Logic, Springer, 2019

work page 1977
[3]

Bertossi, A

L. Bertossi, A. Hunter, and T. Schaub. Introduction to inconsistency tolerance. In L. Bertossi, A. Hunter, and T. Schaub, editors, Inconsistency Tolerance, pages 1--14. Springer, 2005

work page 2005
[4]

Blair and V.S

H.A. Blair and V.S. Subrahmanian. Paraconsistent logic programming. Theoretical Computer Science, 68: 0 135--54, 1989

work page 1989
[5]

Carnielli, J

W. Carnielli, J. Marcos, and S. de Amo. Formal inconsistency and evolutionary databases. Logic and Logical Philosophy, 8 0 (8): 0 115--152, 2000

work page 2000
[6]

J. Celko. SQL for Smarties: Advanced SQL Programming. Elsevier, 3 edition, 2005

work page 2005
[7]

Coniglio and A

M. Coniglio and A. Rodrigues. From Belnap-Dunn four-valued logic to six-valued logics of evidence and truth. Studia Logica, 112(3): 0 561--606, 2024

work page 2024
[8]

de Amo, W

S. de Amo, W. Carnielli, and J. Marcos. A logical framework for integrating inconsistent information in multiple databases. In T. Eiter and K-D. Schewe, editors, Foundations of Information and Knowledge Systems, pages 67--84. Springer, 2002

work page 2002
[9]

D'Ottaviano and N

I. D'Ottaviano and N. da Costa. Sur un probl\' e me de J a\' s kowski. Comptes Rendus de l'Académie des Sciences, 270 0 (A): 0 1349--1353, 1970. URL https://gallica.bnf.fr/ark:/12148/bpt6k480298g/f1359.item

work page 1970
[10]

J.M. Dunn. The Algebra of Intensional Logics. PhD thesis, University of Pittsburgh, 1966. URL https://www.researchgate.net/publication/263125907_The_Algebra_of_Intensional_Logics. Reprinted as Vol. 2 of Logic PhDs Series, College Publications, 2019

work page arXiv 1966
[11]

R.L. Epstein. The semantic foundations of logic. Volume 1: Propositional logics. Springer Science+Business Media, Dordrecht, 1990

work page 1990
[12]

Freire and M

A. Freire and M. A. Martins. Modality across different logics. Logic Journal of the IGPL, 33 0 (3): 0 jzae082, 08 2024. doi:10.1093/jigpal/jzae082

work page doi:10.1093/jigpal/jzae082 2024
[13]

Freire, A

A. Freire, A. Madeira, and M. A. Martins. Lattices for many-logics modal logic: constructions and representations. In Artificial intelligence logic and applications. The 4th international conference, AILA 2024, Lanzhou, China, August 10--11, 2024. Proceedings, pages 32--46. Singapore: Springer, 2025. ISBN 978-981-960353-4; 978-981-960354-1. doi:10.1007/97...

work page doi:10.1007/978-981-96-0354-1_3 2024
[14]

A. R. Freire and M. A. Martins. Regular non-normal modal classicalities. In print, 2025

work page 2025
[15]

Grzegorczyk

A. Grzegorczyk. A philosophically plausible formal interpretation of intuitionistic logic. Indagationes Mathematicae, 26: 0 596--601, 1964

work page 1964
[16]

Hazen and F

A. Hazen and F. Pelletier. K3, 3, LP, RM3, A3, FDE, M: How to make many-valued logics work for you . In H. Omori and H. Wansing, editors, New Essays on Belnap-Dunn Logic. Springer, 2019

work page 2019
[17]

S. Kripke. Semantical analysis of intuitionistic logic I . In Crossley and Dummett, editors, Formal Systems and Recursive Functions, volume 40, pages 92--130. Elsevier, 1965

work page 1965
[18]

Omori and T

H. Omori and T. Waragai. Some Observations on the Systems LFI1 and LFI1* . In Proceedings of DEXA2011, pages 320--324. IEEE Computer Society, 2011

work page 2011
[19]

A.P. Pynko. Functional completeness and axiomatizability within B elnap's four-valued logic and its expansions. Journal of Applied Non-Classical Logics, 0 (9): 0 61--105, 1999

work page 1999
[20]

Rodrigues and H

A. Rodrigues and H. Antunes. First-order logics of evidence and truth with constant and variable domains. Logica Universalis, 16: 0 419--449, 2022

work page 2022
[21]

Rodrigues and W

A. Rodrigues and W. Carnielli. On Barrio, Lo Guercio, and Szmuc on logics of evidence and truth . Logic and Logical Philosophy, 31: 0 313--338, 2022

work page 2022
[22]

H. Wansing. The Logic of Information Structures. Springer, 1993

work page 1993
[23]

Wansing and N

H. Wansing and N. Belnap. Generalized truth values: A reply to Dubois . Logic Journal of the IGPL, 18 0 (6): 0 921--935, 2009

work page 2009