Annotated logics were introduced by V. S. Subrahmanian as logical foundations for computer programming. One of the difficulties of these systems from the logical point of view is that they are not structural, i.e., their consequence relations are not closed under substitutions. In this paper we give systems of annotated logics that are equivalent to those of Subrahmanian in the sense that every...

Matroid theory is a generalization of the idea of linear independence. A matroid M consists of a finite set E (called the ground set) and a collection S of subsets of E satsifying the following conditions: (1) ∅ ∈ S; (2) if I ∈ S, then every subset of I is in S; (3) if I1 and I2 are in S and |I1| < |I2|, then there is an element e of I2 − I1 such that I1 ∪ e is in S. The elements of S are calle...

An inequality between the number of coverings in the ordered set J(Con L) of join irreducible congruences on a lattice L and the size of L is given. Using this inequality it is shown that this ordered set can be computed in time O(n2 log2 n), where n = |L|. This paper is motivated by the problem of efficiently calculating and representing the congruence lattice Con L of a finite lattice L. Of c...

Perfect congruences on a free monoid X* are characterized in terms of congruences generated by partitions of X U {1}. It is established that the upper semilattice of perfect congruences if V-isomorphic to the upper semilattice of partitions on Xu{1}. A sublattice of the upper semilattice of perfect congruences is proved to be lattice isomorphic to the lattice of partitions on X. Introduction an...

fuzzy order congruences play an important role in studying the categoricalproperties of fuzzy posets. in this paper, the correspondence between the fuzzyorder congruences and the fuzzy order-preserving maps is discussed. we focus onthe characterization of fuzzy order congruences on the fuzzy poset in terms ofthe fuzzy preorders containing the fuzzy partial order. at last, fuzzy completecongruen...

The Delannoy numberD(h,k)=∑j=0h(kj)(h+k−jk) counts all lattice paths from (0,0) to (h,k) by using the steps (1,0), (0,1) and (1,1). Define q-Delannoy numberDq(h,k)=∑j=0hq(j+12)[kj]q[h+k−jk]q. Using a combinatorial interpretation of Dq(h,k) based on area statistics, we prove Lucas-type congruence for numbers.

In this paper, we introduce the notions of Belluce lattice associated with a bounded $BCK$-algebra and reticulation $BCK$-algebra. To do this, first, define operations $curlywedge ,$ $curlyvee $ $sqcup on $BCK$-algebras study some algebraic properties them. Also, for $A$ Zariski topology Spec(A)$ induced $tau _{A,Max(A)}$ $Max(A)$. We prove $(Max(A),tau_{A,Max(A)})$ is compact topological space...

This paper is motivated by the interplay between the Tamari lattice, J.-L. Loday’s realization of the associahedron, and J.-L. Loday and M. Ronco’s Hopf algebra on binary trees. We show that these constructions extend in the world of acyclic k-triangulations, which were already considered as the vertices of V. Pilaud and F. Santos’ brick polytopes. We describe combinatorially a natural surjecti...

The association between hyperstructures and binary relations had been intensively studied 5,6,10,11,2,4,20 . Chvalina 5,6 and Hort 2 use ordered structures for the construction of semigroups and hypergroups. Rosenberg 4 associated with any binary relation of full domain, a hypergroupoid and found conditions on , such that is a hypergroup. Corsini and Leoreanu 16 study hypergroups and binary rel...

In this paper, we give an algorithm for presenting S-unit groups of an order O in a definite rational quaternion algebra B such that, for every p ∈ S at which B splits, the localization of O at p is maximal and all left ideals of O of norm p are principal. We then apply this to give presentations for projective S-unit groups of the Hurwitz order in Hamilton’s quaternions over the rational field...