2 citations · 2 across the 4 of their papers we have counts for
5 papers
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…
Constructive proofs for the standard translation of many-sorted to unsorted predicate logic
Hrafn Valtýr Oddsson
It is well known that many-sorted logic can be reduced to unsorted first-order logic by adding predicates for each sort, relativizing quantifiers to these predicates, and adding ap…
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…
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.
Paraconsistent and Paracomplete Zermelo-Fraenkel Set Theory
Yurii Khomskii, Hrafn Valtýr Oddsson
We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true…