Hrafn Valtýr Oddsson

most citedProof-Theoretic Functional Completeness for the Connexive Logic C

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing math.LOShow all

3 papers · 1 filter

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 $BZFC$ , where sets can be inconsistent ( $A$ such that `` $x \in A$ '' is bo…

math.LO2026

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…

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.