Proofs involving infinite structures can use corecursive functions as inhabitants of a corecursive type. Admissibility of such functions in theorem provers such as Coq or Agda, requires that these functions are productive. Typically this is proved by showing satisfaction of a guardedness condition. The guardedness condition however is extremely restrictive and many programs which are in fact pr...

In aggregation theory, the admissibility condition for clustering together components to be aggregated is blockwise weak separability, which also is the condition needed to separate out sectors of the economy. Although weak separability is thereby of central importance in aggregation and index number theory and in econometrics, prior attempts to produce statistical tests of weak separability ha...

How does one obtain an admissible heuristic for a kinodynamic motion planning problem? This paper develops the analytical tools and techniques to answer this question. A sufficient condition for the admissibility of a heuristic is presented which can be checked directly from the problem data. This condition is also used to formulate a concave program to optimize an admissible heuristic. This op...

This note was prepared for a minisymposium on traffic flow at the SIAM Annual Meeting, July 10, 2001. It contains a brief discussion of two traffic flow models that illustrate some interesting aspects of the theory of nonlinear hyperbolic conservation laws. The first is a model of night-time driving that gives a nonconvex flux function in the classical LWR model, but for which the standard Olei...

The paper studies the admissibility of some cancellation rules in normal modal systems with the Brouwerian axiom. For example, KDB and KTB are proved to admit the following rule: if`:(^) and`3 3 then`:(_). Two notions of the preservation of validity by a rule on a frame are deened; on both, the preservation of validity by the preceding rule is shown not to be a rst{order condition. A speculativ...

A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are normal numbers. In Kamae (1973) selection functions that are not depend on sequences (depend only on coordinates) are studied, and their necessary and sufficie...

Consider a parametric statistical model P (dx|θ) and an improper prior distribution ν(dθ) that together yield a (proper) formal posterior distribution Q(dθ|x). The prior is called strongly admissible if the generalized Bayes estimator of every bounded function of θ is admissible under squared error loss. Eaton [Ann. Statist. 20 (1992) 1147–1179] has shown that a sufficient condition for strong ...

We propose new Kruzhkov type entropy conditions for one dimensional scalar conservation law with a discontinuous flux in rather general form (no convexity or genuine linearity is needed). We prove existence and uniqueness of the entropy admissible weak solution to the corresponding Cauchy problem merely under the assumption that initial data belong to the BVclass. Such initial data enable us to...

ity of the desired transfer-function matrix T,(s) is that the matrix equation (9) is consistent for m > 3 m (i.e., for the case where there are more equations than unknowns). However, as it is seen below, this condition is not sufficient. Suppose that it is required to test the admissibility of a desired transfer-function matrix TAs). Also consider another transfer-function matrix Tu@), for whi...