Rough bi-Heyting algebra and its applications on Rough bi-intuitionistic logic
Abstract
A Rough semiring (T,,∇) is considered to describe a special distributive Rough semiring known as a Rough bi-Heyting algebra. A bi-Heyting algebra is an extension of boolean algebra and it is accomplished by weaker notion of complements namely pseudocomplement (*), dual pseudocomplement (+), relative pseudocomplement (→) and dual relative pseudocomplement (←). In this paper, it is proved that the elements of the Rough semiring (T,,∇) are accomplished with the pseudocomplement, relative pseudocomplement along with their duals. The definition of pseudocomplement leads to the concept of Brouwerian Rough semiring structure (T,,∇,*,RS(),RS(U)) on the Rough semiring (T,,∇). Also it is proved (T,,∇,→,←,RS(),RS(U)) is a Rough bi-Heyting algebra. The concepts are illustrated with the examples. As an application, this Rough bi-Heyting algebra is used to model Rough bi-intuitionistic logic. The syntax is defined and three types of semantics for Rough bi-intuitionistic logic are defined and validated.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.