We show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no oth...
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Background: High-throughput genomic research tools are becoming standard in the biologist's toolbox. After processing the genomic data with one of the many available statisti...
In [6] Besnard and Schaub elaborated a novel approach to paraconsistent reasoning which lead to a family of paraconsistent consequence relations. In a sense these try to safeguard...
: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...