PreprintarXiv licencearXiv
Possibilistic Logic over a Logic of Formal Inconsistency
Abstract
In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.
Related
- A Formal Proof of Riemann Hypothesis from Existence Alone, the Sign Excepted by Theorem: The Constructed Witness, the Identity Cone over the Fixed Locus, the Grounded Counter-Model, and the Cure Theorem Proved in Lean 4 and Re-executed in Fortran
- A polynomial method over formal power series
- An Efficient Monte Carlo Method for Valid Prior-Free Possibilistic Statistical Inference
- Induction and the rule of succession through a possibilistic inferential model lens
- Open-ended Scientific Discovery with Possibilistic Reasoning
BibTeX
@misc{jain2026possibilistic,
title = {{Possibilistic Logic over a Logic of Formal Inconsistency}},
author = {Esha Jain and Sankha S. Basu},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.11491},
eprint = {2609.11491},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.11491},
}
RIS
TY - UNPB
TI - Possibilistic Logic over a Logic of Formal Inconsistency
AU - Esha Jain
AU - Sankha S. Basu
PY - 2026
DA - 2026/09/10
PB - arXiv
DO - 10.48550/arxiv.2609.11491
UR - https://arxiv.org/abs/2609.11491
AB - In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.
ER -