The "procedures" discussed in this paper are of the following type: The statistician makes a conventional decision (in a multiple decision problem). He also provides a statement of the guaranteed conditional probability that his decision will be correct, given the observed value of some conditioning random variable. Various admissibility criteria to relate such procedures are proposed. For exam...

The current document contains the proofs of the COMMA 2014 submission “Strong Admissibility Revisited” and should be read in conjunction with it.

A new hierarchy of “exact” unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by instantiation, but rather by inclusion over the corresponding sets of unified identities. Minimal complete sets of unifiers under this new preordering always h...

This paper shows how to apply a particular chance-credence principle, called the General Principle, to the case of two divergent level-relative chances of a given proposition in order to single out level-relative chance that should underpin one’s credence in that proposition. It is shown that the key move hinges on the use of admissibility clause in the GP. This principle is, then, tested again...

Appellate opinions were evaluated on variables related to expert admissibility to assess the effects of Daubert v. Merrell Dow Pharmaceuticals, Inc. in criminal cases. Analysis reveals changes in appellate courts’ consideration of Frye v. United States, the 4 Daubert criteria, and several Federal Rules of Evidence. The importance of Frye and the general acceptance criterion decreased over time,...

Nearly all autonomous robotic systems use some form of motion planning to compute reference motions through their environment. An increasing use of autonomous robots in a broad range of applications creates a need for efficient, general purpose motion planning algorithms that are applicable in any of these new application domains. This thesis presents a resolution complete optimal kinodynamic m...

We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameterfree admissibility and unification to the setting with parameters. Specifically, we give a characterization of projective formulas generalizing Ghilardi’s characterization in the parameter-free case, leading to new proof...

The concept of ‘fully permissible sets’ is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on the set of all opponent strategies or on the union of the choice sets that are deemed possible for the oppo...

Brandenburger et al. (2008) establish epistemic foundations for rationality and common assumption of rationality (RCAR), where rationality includes admissibility, using lexicographic type structures. Their negative result that RCAR is empty whenever the type structure is complete and continuous suggests that iterated admissibility (IA) requires players to have prior knowledge about each other, ...

Abstract In lattice compact gauge theories, we must impose the admissibility condition to have well-defined topological sectors. The condition, however, usually forbids presence of magnetic operators, and it is not so trivial if one can study physics objects that depends on term, such as Witten effect, lattice. this paper, address question in case 2D scalars would be simplest examples having an...