3 papers
math.LO2026
Cardinality in a paraconsistent and paracomplete set theory
Hrafn Valtýr Oddsson
This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory , where sets can be inconsistent ( such that ``'' is bo…
cs.LO2025
Proof-Theoretic Functional Completeness for the Connexive Logic C
Sara Ayhan, Hrafn Valtýr Oddsson
We show the functional completeness for the connectives of the non-trivial negation inconsistent logic C by using a well-established method implementing purely proof-theoretic noti…
math.LO2025
Strong Negation is Definable in 2Int
Hrafn Valtýr Oddsson
I show that the strong negation is definable in 2Int, Wansing's bi-intuitionistic logic.