Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Barycentric algebras have seen widespread application in the modeling of convex sets, semilattices, and quantum mechanics. Recently, they were developed further to encompass Boolea...
Extensions of monoidal t-norm logic MTL and related fuzzy logics with truth stresser modalities such as globalization and “very true” are presented here both algebraically in ...
Agata Ciabattoni, George Metcalfe, Franco Montagna
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...