Assuming that every proper minor closed class of graphs contains a maximum with respect to the homomorphism order, we prove that such a maximum must be homomorphically equivalent ...
A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1, . . . , k − 1} under cyclic rotation. In this paper we define an ordering on t...
For general law invariant coherent measures of risk, we derive an equivalent representation of a risk-averse newsvendor problem as a meanrisk model. We prove that the higher the w...
Using HOL4, we mechanise termination and correctness for two unification algorithms, written in a recursive descent style. One computes unifiers for first order terms, the other fo...
We investigate interpretations ψ D of formulas ψ in a first order fuzzy logic in models D which are based on Ω-sets, i.e. sets with similarity relations with values in a comp...