We analyze common reasoning about admissibility in the strategic and extensive form of a game. We define a notion of sequential proper admissibility in the extensive form, and show that, in finite extensive games with perfect recall, the strategies that are consistent with common reasoning about sequential proper admissibility in the extensive form are exactly those that are consistent with com...

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....

    Necessary conditions for  shearlet  and cone-adapted shearlet systems to be frames are presented with respect to the admissibility condition of generators.

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...

We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition under which the admissibility problem is coNEXP -hard. We also show that admissibility in several well-known systems (including GL, S4, and IPC ) is in coNE , thus obtaining a sharp complexity estimate for admissibility in...

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.

§13.1 The Forensic Sciences §13.2 The Admissibility of Forensics-Only Science §13.2.1 “General Acceptance” in Forensic Science Should Not Be a Sufficient Condition for Admissibility §13.2.2 “General Acceptance” in Forensic Science Should Not Be a Necessary Condition for Admissibility §13.3 Trace Evidence and Identification §13.3.1 Matches, Non-Matches, and Hypotheses §13.3.2 Exclusions §13.3.3 ...

Several methods for checking admissibility of rules in the modal logic S4 are presented in [1], [15]. These methods determine admissibility of rules in S4, but they don’t determine or give substitutions rejecting inadmissible rules. In this paper, we investigate some relations between one of the above methods, based on the reduced normal form rules, and sets of substitutions which reject them. ...

In this paper we study the relationship between the notion of coherence for conditional prevision assessments on a family of finite conditional random quantities and the notion of admissibility with respect to bounded strictly proper scoring rules. Our work extends recent results given by the last two authors of this paper on the equivalence between coherence and admissibility for conditional p...

We give new and very general characterizations for uniform exponential dichotomy of variational difference equations in terms of the admissibility of pairs of sequence spaces over N with respect to an associated control system. We establish in the variational case the connections between the admissibility of certain pairs of sequence spaces over N and the admissibility of the corresponding pair...