Our paper aims to investigate inference rules for Nelson’s logics and to discuss possible ways to determine admissibility of inference rules in such logics. We will use the technique offered originally for intuitionistic logic and paraconsistent minimal Johannson’s logic. However, the adaptation is not an easy and evident task since Nelson’s logics do not enjoy replacement of equivalences rule....

We present a purely group-theoretical derivation of the continuous wavelet transform (CWT) on the 2-sphere S2, based on the construction of general coherent states associated to square integrable group representations. The parameter space X of our CWT is the product of SO(3) for motions and R+∗ for dilations on S2, which are embedded into the Lorentz group SO0(3,1) via the Iwasawa decomposition...

Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore decidable. However, since free algebras may be large even for small sets of small algebras and very few generators, this naive method for checking admissibilit...

Best-response sets (Pearce [29, 1984]) characterize the epistemic condition of “rationality and common belief of rationality.” When rationality incorporates a weak-dominance (admissibility) requirement, the self-admissible set (SAS) concept (Brandenburger-Friedenberg-Keisler [18, 2008]) characterizes “rationality and common assumption of rationality.” We analyze the behavior of SAS’s in some ga...

Admissibility is a technical condition that ensures that the fixed point index of the flow is well-defined [Gor06]. Recall that a flow is admissible if and only if it is upper semicontinuous (i.e. if the limit of a convergent sequence of trajectories is a trajectory) and if there exists h > 0 such that, for any point x, the set of trajectory segments S(x,h) starting at x and defined on the time...

In this note we show that for analytic semigroups the so-called Weiss condition of uniform boundedness of the operators Re(λ) 1/2C(λ+A)−1, Re(λ) > 0 on the complex right half plane and weak Lebesgue L2,∞–admissibility are equivalent. Moreover, we show that the weak Lebesgue norm is best possible in the sense that it is the endpoint for the ’Weiss conjecture’ within the scale of Lorentz spaces L...

We use a complex version of the celebrated Atiyah-Hitchin-DrinfeldManin matrix equations to construct admissible torsion-free sheaves on P3 and complex quantum instantons over our quantum Minkowski space-time. We identify the moduli spaces of various subclasses of sheaves on P3, and prove their smoothness. We also define the Laplace equation in the quantum Minkowski space-time, study its soluti...

Admissibility is a useful criterion for selecting among equilibria, but I argue that enforcing admissibility dilutes the power of stability criteria to select among equilibrium components, and this accounts for anomalous examples of stable sets. Therefore, admissibility should be invoked only when selecting equilibria within a component that is immune to payoff perturbations.

Suppose that X is a random variable with density f(xj ) and that ( jx) is a proper posterior corresponding to an improper prior ( ). The prior is called P-admissible if the generalized Bayes estimator of every bounded function of is almost-admissible under squared error loss. Eaton (1992) showed that recurrence of the Markov chain with transition density R( j ) = R ( jx)f(xj )dx is a su cient c...

In this paper, we investigate the regulation problem for linear discrete-time delay systems with Markovian jumps and constrained control. The constraints used here are of non symmetrical inequality type. A sufficient condition of stochastic stability of a closed loop system is derived. We use the positive invariance approach of the common set for all the modes to guarantee the admissibility of ...