Fiat categorification of the symmetric inverse semigroup IS_n and the semigroup F^*_n

Starting from the symmetric group $S_n$, we construct two fiat $2$-categories. One of them can be viewed as the fiat "extension" of the natural $2$-category associated with the symmetric inverse semigroup (considered as an ordered semigroup with respect to the natural order). This $2$-category provides a fiat categorification for the integral semigroup algebra of the symmetric inverse semigroup. The other $2$-category can be viewed as the fiat "extension" of the $2$-category associated with the maximal factorizable subsemigroup of the dual symmetric inverse semigroup (again, considered as an ordered semigroup with respect to the natural order). This $2$-category provides a fiat categorification for the integral semigroup algebra of the maximal factorizable subsemigroup of the dual symmetric inverse semigroup.Comment: v2: minor revisio

Reachability for Two-Counter Machines with One Test and One Reset

We prove that the reachability relation of two-counter machines with one zero-test and one reset is Presburger-definable and effectively computable. Our proof is based on the introduction of two classes of Presburger-definable relations effectively stable by transitive closure. This approach generalizes and simplifies the existing different proofs and it solves an open problem introduced by Finkel and Sutre in 2000

A comparison between algebraic query languages for flat and nested databases

AbstractRecently, much attention has been paid to query languages for nested relations. In the present paper, we consider the nested algebra and the powerset algebra, and compare them both mutually as well as to the traditional flat algebra. We show that either nest or difference can be removed as a primitive operator in the powerset algebra. While the redundancy of the nest operator might have been expected, the same cannot be said of the difference. Basically, this result shows that the presence of one nonmonotonic operator suffices in the powerset algebra. As an interesting consequence of this result, the nested algebra without the difference remains complete in the sense of Bancilhon and Paredaens. Finally, we show there are both similarities and fundamental differences between the expressiveness of query languages for nested relations and that of their counterparts for flat relations

A two level representation for spatial relations. - Part I

A model to represent spatial relations is presented. It is used for the definition of common sense knowledge of rational agents in a multi-agent-scenario. The main idea is, that it is structured in two levels: the representation of relations may be accomplished in terms of predicate logic at one level or in expressions of Cartesian coordinates at the other. Hence reasoning is possible with common rules of deduction as well as via exact calculations of the positions. Here we give an overview on the whole structure and then investigate in the definition of a set of spatial relations at the "Logical Level". Finally special features like the handling of the context and the problem of multiple views are discussed

Reconstruction of Finite Truncated Semi-Modular Lattices

AbstractIn this paper, we prove reconstruction results for truncated lattices. The main results are that truncated lattices that contain a 4-crown and truncated semi-modular lattices are reconstructible. Reconstruction of the truncated lattices not covered by this work appears challenging. Indeed, the remaining truncated lattices possess very little lattice-typical structure. This seems to indicate that further progress on the reconstruction of truncated lattices is closely correlated with progress on reconstructing ordered sets in general