Refined Quadripartitioned, Refined Pentapartitioned, Refined Heptapartitioned, and Iterative Refined Neutrosophic Logic

Read the full article See related articles

Discuss this preprint

Start a discussion What are Sciety discussions?

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

A Neutrosophic Set models uncertainty via three memberships—truth, indeterminacy, and falsity. We develop an n–Refined Neutrosophic Logic (n–RNL) that splits these into interpretable subcomponents and define refined quadripartitioned, pentapartitioned, and heptapartitioned families capturing contradiction, ignorance, unknown, and relative truth/falsity. Connectives are given blockwise by a t–norm/t–conorm pair. We prove merge/split homomorphisms that (i) reduce refined models to classical ones and (ii) embed unrefined semantics into refined spaces. We further introduce Iterative Refined Neutrosophic Logic (IRNL), allowing repeated, symmetric refinements with functorial stability of evaluations. Numerical examples from clinical decision support, autonomous driving, and fraud detection illustrate granular reasoning under heterogeneous evidence and priority schemes.

Article activity feed