We examine local strong rationality (LSR) in multivariate models with both forward-looking expectations and predetermined variables. Given hypothetical common knowledge restrictions that the dynamics will be close to those of a specified minimal state variable solution, we obtain eductive stability conditions for the solution to be LSR. In the saddlepoint stable case the saddle-path solution is...

The purpose of this paper is to provide a construction to model shared-variable systems using higher-dimensional automata which is compositional in the sense that the parallel composition of completely independent systems is modeled by the standard tensor product of HDAs and nondeterministic choice is represented by the coproduct.

Diagnostics for normal errors in regression currently utilize ordinary residuals, despite the failure of assumptions validating their use. Case studies here show that such misuse may be critical even in samples of size exceeding currently accepted guidelines. A remedy is to employ recovered errors having the required properties.

The linear measurement error model is an alternative to the classical regression model, in which we assume that the independent variables are subject to error. This assumption can cause statistical inferences and parameter estimators to di er dramatically from those obtained from the classical regression model. However, inferences may remain unchanged even though the independent variables are a...

The notion of Newton–like inequalities is extended and an inductive approach is utilized to show that the generalized Newton–like inequalities hold on elementary symmetric functions with self–conjugate variables in the right half–plane.

We prove boundedness of minimizers of energy-functionals, for instance of the anisotropic type (1.1) below, under sharp assumptions on the exponents pi in terms of p ∗: the Sobolev conjugate exponent of p; i.e., p∗ = np n−p , 1 p = 1 n Pn i=1 1 pi . As a consequence, by mean of regularity results due to Lieberman [21], we obtain the local Lipschitz-continuity of minimizers under sharp assumptio...

Scalable formal verification constitutes an important challenge for the design of asynchronous circuits. Deadlock freedom is a property that is desired but hard to verify. It is an emergent property that has to be verified monolithically. We present our approach to using ACL2 to verify necessary and sufficient conditions over asynchronous delay-insensitive primitives. These conditions are used ...

In this paper we explore a proof-theoretic approach to the combination of generic proof-search and theory-specific procedures, in presence of quantifiers. Forming the basis of tableaux methods, the sequent calculus is refined with meta-variables (a.k.a existential variables or free variables) to delay the choice of witnesses, and parameterised by theory-specific features based on a system of co...

We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-rules for it, we demonstrate cut-elimination for the resulting logic, and we give a semantics for which the logic is sound and complete. Because we can now make assertions about what would normally be considered an intensional pr...