In this note, we define the concepts of admissible relation and admissible partition for an arbitrary BL-general fuzzy automaton.In particular, a connection between the admissible partition and the quotient BL-general fuzzy automaton is presented.It is shown that if we use the maximal admissible partition, then we obtain a quotient BL-general fuzzy automaton and this quotient is minimal. Finall...

The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.  

We address the problem of graph rewriting and narrowing as the underlying operational semantics of rule-based programming languages. We propose new optimal graph rewriting and narrowing strategies in the setting of orthogonal constructor-based graph rewriting systems. For this purpose, we first characterize a subset of graphs, called admissible graphs. A graph is admissible if none of its defin...

Axiomatic bases of admissible rules are obtained for fragments of the substructural logic R-mingle. In particular, it is shown that a “modus-ponens-like” rule introduced by Arnon Avron forms a basis for the admissible rules of its implication and implication-fusion fragments, while a basis for the admissible rules of the full multiplicative fragment requires an additional countably infinite set...

‎In this paper‎, ‎we find a relation between the proportionality factors which arise from the functional equations of two families of local Rankin-Selberg convolutions for‎ ‎irreducible admissible representations of orthogonal groups‎, ‎or unitary groups‎. ‎One family is that of local integrals of the doubling method‎, ‎and the other family is‎ ‎that of local integrals expressed in terms of sph...

While developing a method for reasoning about programs, Pitts defined the ⊤⊤-closed relations as an alternative to the standard admissible relations. This paper reformulates and studies Pitts’s operational concept of ⊤⊤-closure in a semantic framework. It investigates the nontrivial connection between ⊤⊤-closure and admissibility, showing that ⊤⊤-closure is strictly stronger than admissibility ...

We derive consequences from the existence of a term which satisfies Mal’cev identities (characterizing permutability) modulo two functions F and G from admissible relations to admissible relations. We also provide characterizations of varieties having a Mal’cev term modulo F and G. Given an algebra A, let Adm(A) denote the set of all reflexive and admissible relations on A (we shall use the wor...

Our paper investigates the linear logic of knowledge and time LTKr with reflexive intransitive time relation. The logic is defined semantically, – as the set of formulas true at special frames with intransitive and reflexive time binary relation. The LTKr-frames are linear chains of clusters connected by a reflexive intransitive relation RT . Elements inside a cluster are connected by several e...