A sufficient condition is given for a probability function in Inductive Logic (with relations of all arities) satisfying spectrum exchangeability to additionally satisfy Language ...
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Ram...
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...