in this paper, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them.  and we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. also, we prove that  right and product stabilizers are filters and if they are ...

We present a derivation of a regular language recognizing circuit originally developed by Foster and Kung [4]. We make use of pointfree relation algebra, in a style combining elements from earlier work in the Eindhoven Mathematics of Program Construction group [0], and from Ruby [6]. First we derive non-systolic recognizers, much in the same way as functional programs are derived. Then we make ...

Abstract: Unlike a uniformity, a quasi-uniformity is not determined by its quasiuniform covers. However, a classical construction, due to Fletcher, which assigns a transitive quasi-uniformity to each family of interior-preserving open covers, allows to describe all transitive quasi-uniformities on the topological spaces in terms of those families of covers. In this paper we develop a pointfree ...

Tool interoperability as a mean to achieve integration is among the main goals of the international Grand Challenge initiative. In the context of the Verifiable file system mini-challenge put forward by Rajeev Joshi and Gerard Holzmann, this paper focuses on the integration of different formal methods and tools in modelling and verifying an abstract file system inspired by the Intel © Flash Fil...

The maximum segment sum problem is to compute, given a list of integers, the largest of the sums of the contiguous segments of that list. This problem specification maps directly onto a cubic-time algorithm; however, there is a very elegant linear-time solution too. The problem is a classic exercise in the mathematics of program construction, illustrating important principles such as calculatio...

It is well known that a locale is subfit iff each of its open sublocales is a join of closed ones, and fit iff each of its closed sublocales is a meet of open ones. This formulation, however, exaggerates the parallelism between the behavior of fitness and subfitness. For it can be shown that a locale is fit iff each of its sublocales is a meet of closed ones, but it is not the case that a local...

in this paper we investigate generalized topologies generated by a subbase ofpreorder relators and consider its application in the concept of the complement. we introducethe notion of principal generalized topologies obtained from the new type of open sets andstudy some of their important properties.

In analysis, truncation is the operation of replacing a nonnegative real-valued function a (x) by its pointwise meet a (x) ∧ 1 with the constant 1 function. A vector lattice A is said to be closed under truncation if a ∧ 1 ∈ A for all a ∈ A. Note that A need not contain 1 itself. Truncation is fundamental to analysis. To give only one example, Lebesgue integration generalizes beautifully to any...