Matrix characterization of Ciuciura's paraconsistent hierarchy Ciun
Abstract
In this paper, we will prove that the logics of the family Ciun:=\Ciun\n ∈ ω of paraconsistent Ciuciura's Logics (defined by means of bivaluations) can be alternatively defined by means of finite matrices. This result arises from the characterization of the truth-values of the involved matrices (relative to each Ciun-logic) as being specific finite sequences of elements of the set 2 := \0,1\. Moreover, we will show along the paper that this characterization is related to the well-known standard Fibonacci Sequence, which is presented here by means of its binary expansion.
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.