We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...