Search arXivSearch

arXiv · 2609.13284

Decoupling Evidence Sources in Paraconsistent Logic: A Generalized PAL2v Framework for Educational Assessment

Abstract

Paraconsistent Annotated Logic with two values (PAL2v) annotates a proposition with a pair $(μ,λ)$ of degrees of favorable and unfavorable evidence, drawn from a bilattice whose four extreme points are the values of Belnap and Dunn. In applications, however, the second coordinate is almost always taken to be the complement of the first, and several such annotations are then fused. We show that this practice determines the sign of the degree of contradiction in advance, independently of the data: for aggregation functions $F$ and $G$ the fused degree of contradiction equals $F-G^{d}$, where $G^{d}$ is the De Morgan dual of $G$, so that it vanishes identically when the two are dual, and has a constant sign otherwise. In particular the componentwise minimum used throughout the literature yields only consistent annotations, and the conjunction of annotated logic only exact ones; five of the twelve logical states, contradiction among them, are essentially unreachable by construction. We also give a decision procedure for the twelve states that is provably total, in place of the inequality lists in current use, which assign two states to about half of the non-extreme region. We then propose a construction in which the two coordinates are computed from disjoint families of evidence, show that every logical state is attainable. Educational assessment provides a natural instance, since summative and formative instruments are institutionally distinct: mapping examinations to $μ$ and disengagement to $λ$ makes the degree of contradiction equal to the gap between what a student demonstrates and what that student invests. Simulations over three cohort profiles illustrate the classification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arthur Nakamura, David Drummond, Welbert Pereira, Gustavo Lahr, Kaique Matias de Andrade Roberto. 2026-09-08. Decoupling Evidence Sources in Paraconsistent Logic: A Generalized PAL2v Framework for Educational Assessment. https://arxiv.org/abs/2609.13284

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deciding Predicate Logical Theories of Real-Valued Functions

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible.

cs.LO

Structural Liveness of Conservative Petri Nets

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the values of the minimal live markings are at most doubly exponential in the size of the net. This implies the EXPSPACE-completeness of structural liveness for conservative Petri nets. The result also applies to structurally bounded Petri nets, whereas the complexity of the general case remains open. As a proof ingredient of independent interest, we present an extension of known results on the bounds of minimal integer solutions to Boolean combinations of linear equalities, inequalities, and divisibility constraints.

cs.LO

Verifying Numerical Methods with Isabelle/HOL

Modern machine learning pipelines and ODE solvers are built on numerical algorithms. Reliable numerical methods are thus a prerequisite for trustworthy machine learning and cyber-physical systems. We evaluate a framework designed for verifying imperative programs and the Isabelle proof assistant as tools for proving the total correctness of four numerical algorithms: the bisection method, the fixed-point method, the perceptron, and the gradient descent algorithm. Our verifications required subtle extensions and generalisations to Isabelle's version of Taylor's theorem and higher-order derivatives. Finally, we reflect on the framework's automation, friendly syntax, and on further requirements to turn it into a verification tool for numerical methods.

cs.LO