Countable nondeterminism and logics of programs: fair-wellfoundedness of while-programs with nondeterministic assignments in the logic ALNA
In [6] da Costa has introduced a new hierarchy , of logics that are both paraconsistent and paracomplete. Such logics are now known as non-alethic logics. In this article we present an algebraic version of the logics and study some of their properties.