We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, w...
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
Machine Learning systems are often distinguished according to the kind of representation they use, which can be either propositional or first-order logic. The framework working wi...
Teresa Maria Altomare Basile, Floriana Esposito, N...