We develop the flow analog of the classical Yosida adjunction between spaces and archimedean lattice-ordered groups with strong unit. A product of this development is the flow counterpart of the classical compactification of a space. We characterize those flows which are compactifiable, i.e., dense subflows of a compact flow. Finally, we exhibit a duality between the compactifications of a give...

We discuss the logic of pregroups, introduced by Lambek [34], and its connections with other type logics and formal grammars. The paper contains some new ideas and results: the cut-elimination theorem and a normalization theorem for an extended system of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (quasi-ordered) bilinear algebras and pregroups w...

Forest algebras are defined for investigating languages of forests [ordered sequences] of unranked trees, where a node may have more than two [ordered] successors [9]. We show that several parameters on forests can be realized as forest algebra homomorphisms from the free forest algebra into algebras which retain the equational axioms of forest algebras. This includes the number of nodes, the n...

A semiring can be “completed” (i.e., embedded into a semiring in which all infinite sums are defined and satisfy some reasonable properties) iff this semiring can be naturally partially ordered. This construction is “natural” (a left adjoint to the forgetful functor), and quite straightforward. Definitions and easy facts Definition 1. A semiring is a structure (S,+, ·, 0, 1) such that (S,+, 0) ...

A totally ordered monoid, or tomonoid for short, is a monoid endowed with a compatible total order. We deal in this paper with tomonoids that are finite and negative, where negativity means that the monoidal identity is the top element. Examples can be found, for instance, in the context of finite-valued fuzzy logic. By a Rees coextension of a negative tomonoid S, we mean a negative tomonoid T ...

Introduction A special monoid is a monoid presented by generators and defining relations of the form w = e, where w is a non-empty word on generators and e is the empty word. Groups are special monoids. But there exist special monoids that are not groups. Special monoids have been extensively studied by Adjanfl] and Makanin[7] (see also [2]). The present paper is a sequel to [11]. In [11], we s...

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the endomorphism monoid, or the polymorphism clone of a structure. Such functions can be particularly well understood when the relational structure is countably infin...

In this paper we have introduced a class of decision rules related to simple majority, by considering individual intensities of preference. These intensities will be shown by means of linguistic labels. In order to compare the amount of opinion obtained by each alternative, we have considered the total ordered monoid generated by the sums of the original labels, according to an addition and an ...

A partitioned process theory, as defined by Coecke, Fritz, and Spekkens, is a symmetric monoidal category together with an all-object-including symmetric monoidal subcategory. We think of the morphisms of this category as processes, and the morphisms of the subcategory as those processes that are freely executable. Via a construction we refer to as parallel-combinable processes with discarding,...

This work formally introduces and starts investigating the structure of matrix polynomial algebra extensions a coefficient by (elementary) matrix-variables over ground ring in not necessary commuting variables. These subalgebras full rings show up noncommutative algebraic geometry. We carefully study their (one-sided or bilateral) noetherianity, obtaining precise lift Hilbert Basis Theorem when...