Automata over infinite words provide a powerful framework, which we can use to solve various decision problems. However, the automatized reasoning with restricted classes of automata over infinite words is often simpler and more efficient. For instance, weak deterministic Büchi automata, which recognize the ω-regular languages in the Borel class Fσ ∩Gδ, can be handled algorithmically almost as ...

In this paper a binary relation between L-sets, called attachment, is defined by means of a suitable family of completely coprime filters in L. Examples are given using several kinds of lattice-ordered algebras and a class of attachments is determined whose elements generalize Pu-Liu’s quasi-coincidence relation. Mapping any L-set on X to the set of the attached L-points one gets a frame map fr...

We present here a view on abstraction based on the relation between sentences in a partially ordered language L and truth values of these sentences on a set of instances W . In Formal Concept Analysis, this relation is materialized as a lattice denoted as G that relates L and the powerset P(W )). We show here that projections on a lattice (here either L or the powerset P(W )) that are known to ...

We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical formulae with restricted universal quantifiers and the powerset operator. Our result apply to a rather large class of set theories. The procedure we define can be used as a subroutine to decide the same class of formulae both in Set Theory and in non well-founded set theories, since we assume neither...

Besides all the attention given to lattice constructions, it is common to find some very interesting nonlattice constellations, as Construction C, for example, which also has relevant applications in communication problems (multi-level coding, multi-stage decoding, good quantization efficieny). In this work we present a constellation which is a subset of Construction C, based on inter-level cod...

on utilizing the spectral representation of selfadjoint operators in hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in hilbert spaces via a taylor's type expansion are given.

This paper discusses a case study of the board game of Scotland Yard from a computational perspective. Interestingly, Scotland Yard is a genuine “playgame” with imperfect information. For reasons not completely clear to me, games with imperfect information have escaped the interest of researchers in Algorithmic combinatorial gametheory. I show by means of a powerset argument, that Scotland Yard...

We give a category-theoretic formulation of Engeler-style models for the untyped λ-calculus. In order to do so, we exhibit an equivalence between distributive laws and extensions of one monad to the Kleisli category of another and explore the example of an arbitrary commutative monad together with the monad for commutative monoids. On Set as base category, the latter is the finite multiset mona...

The recent theory of plausible and paradoxical reasoning (DSmT) developed by the authors appears to be a nice promising theoretical tools to solve many information fusion problems where the Shafer’s model cannot be used due to the intrinsic paradoxical nature of the elements of the frame of discernment and where a strong internal conflict between sources arises. The main idea of DSmT is to work...