We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a s...
A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ..., Ap are said to be cross-intersec...