A Polynomial Approach to Evidence: Algorithmic-Algebraic Methods for $$\textsf{FDE}$$ and $$\mathsf {LET_F}$$

This paper characterises the Belnap–Dunn logic of first-degree entailment ( $$\textsf{FDE}$$ ) and one of its extensions, the logic of evidence and truth ( $$\mathsf {LET_F}$$ ), by means of polynomials with coefficients in the ring $$\mathbb {Z}_2$$ . Two alternative algorithmic-algebraic methods for determining the deductive status of a formula with respect to a finite set of formulas in these logics are presented. The first method is based on the theory of Gröbner’s bases, while the second is based on Carnielli’s method of Polynomial Ring Calculus (PRC). Furthermore, it is noted that the satisfiability problem for these logics can also be solved using algebraic computation.

Authors

Institutions

Publication Details

Journal
Journal of Automated Reasoning
Published
2026-11-19
DOI
https://doi.org/10.1007/s10817-026-09770-z
Primary Topic
Advanced Algebra and Logic
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Polynomial Approach to Evidence: Algorithmic-Algebraic Methods for $$\textsf{FDE}$$ and $$\mathsf {LET_F}$$

Walter Alexandre Carnielli, Juliana Bueno-Soler, Juan C. Agudelo-Agudelo
Journal of Automated Reasoning
Advanced Algebra and Logic
article

A Polynomial Approach to Evidence: Algorithmic-Algebraic Methods for $$\textsf{FDE}$$ and $$\mathsf {LET_F}$$

Walter Alexandre Carnielli, Juliana Bueno-Soler, Juan C. Agudelo-Agudelo
article en

Abstract

This paper characterises the Belnap–Dunn logic of first-degree entailment ( $$\textsf{FDE}$$ ) and one of its extensions, the logic of evidence and truth ( $$\mathsf {LET_F}$$ ), by means of polynomials with coefficients in the ring $$\mathbb {Z}_2$$ . Two alternative algorithmic-algebraic methods for determining the deductive status of a formula with respect to a finite set of formulas in these logics are presented. The first method is based on the theory of Gröbner’s bases, while the second is based on Carnielli’s method of Polynomial Ring Calculus (PRC). Furthermore, it is noted that the satisfiability problem for these logics can also be solved using algebraic computation.

Journal of Automated ReasoningVol. 70(2)
Universidade Estadual de Campinas (UNICAMP) (BR), Universidad de Antioquia (CO)
Chapman University, Fundação de Amparo à Pesquisa do Estado de São Paulo, Conselho Nacional de Desenvolvimento Científico e Tecnológico, Universidad de Antioquia
Advanced Algebra and Logic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon