In the theory of Type Two Effectivity (Weihrauch 2000), computation on non-discrete spaces is performed by type two Turing machines, which compute with infinite words acting as names for elements of spaces. The connection between names and their associated elements is specified by a many-to-one relation called a representation. Such representations induce a topology on the named elements, namel...

We study second adjointness in the context of tempered admissible representations a real reductive group. Compared to recent result Crisp and Higson, this generalizes from SL2 general group, but specializes only considering representations. also discuss Casselman’s canonical pairing context, relation Bernstein morphisms. Additionally, we take opportunity some relevant functors their relations.

KR is a very efficient knowledge representation language implemented in Common Lisp. It provides powerful frame-based knowledge representation with user-defined inheritance and relations, and an integrated object-oriented programming system. In addition, the system supports a constraint maintenance mechanism which allows any value to be computed from a combination of other values. KR is simple ...

Algebraic properties and structures of intuitionistic $$L-$$ fuzzy multiset finite automata (ILFMA) are discussed through congruences on a semigroup in this paper. Firstly, we put forward the notion compatible relation, monoid associated with relation can be effectively constructed, construct two monoids different congruence relations given ILFMA, then prove that they isomorphic. Furthermore, u...

The relation between two systems of attitude ascription that capture all the empirically signiŽ cant aspects of an agent’s thought and speech may be analogous to that between two systems of magnitude ascription that are equ ivalent relative to a transformation of scale. If so, ju st as an object’s weighing eight pounds doesn’t relate that object to the number 8 (for a different bu t equally goo...

A pinnacle of a permutation is value that larger than its immediate neighbors when written in one-line notation. In this paper, we build on previous work characterized admissible sets permutations. For these sets, there can be specific orderings the pinnacles are not admissible, meaning they realized by any permutation. Here characterize orderings, using relationship between x and rank set to b...

In this paper, we consider admissible estimation of the parameter ?r in the gamma distribution with truncated parameter space under entropy loss function. We obtain the classes of admissible estimators. The result can be applied to estimation of parameters in the normal, lognormal, pareto, generalized gamma, generalized Laplace and other distributions.