Address: University of Bergen Department of Informatics HiB, 5020 Bergen, NORWAY Ph. : +47 55 58-41-78 Fx. : +47 55 58-41-99 E-mail : myforename-at-ii-dot-uib-dot-no Interests: self-reference and semantic closure, digraph kernels, paraconsistency. more specifically: (CURRENT) Graph representation of logical theories: Classical/paraconsistent semantics represented by digraph kernels/semikernels Graph Normal Form and its applications Logical circularity as graph cycles Semantic paradoxes, self-referenceThe earlier conjecture: A digraph with no kernel has an odd cycle or a ray with infinitely many vertices dominating it.
has been proven for: 1. graphs with finite number of ends (Discrete Mathematics, 2019) 2. A variant of Poison Game, introduced by Duchet and Meyniel for finite digraphs, which can be useful for proving (non)existence of (semi)kernels on infinite digraphs.
(PAST) Universal algebra and category theory: Categories of multialgebras Relational and power structures Algebraic treatment of nondeterminism