Related papers: The converse envelope theorem
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
This paper provides a rigorous and gap-free proof of the index theorem used in the theory of regular economy. In the index theorem that is the subject of this paper, the assumptions for the excess demand function are only several usual…
This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…
Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
By suitable examples we illustrate an algorithm for composition of inverse problems.
We introduce A-ranked preferential structures and combine them with an accessibility relation. This framework allows us to formalize contrary to duty obligations. Representation results are proved.
We generalize our theorems in "Mirror Principle I" to a class of balloon manifolds. Many of the results are proved for convex projective manifolds. In a subsequent paper, Mirror Principle III, we will extend the results to projective…
In this paper generalize Robinson's version of an order cancellation law for subsets of vector spaces in which we cancel by unbounded sets. We introduce the notion of weakly narrow sets in normed spaces, study their properties and prove the…
According to Karl Popper assumptions are statements used to construct theories. During the construction of a theory whether the assumptions are either true or false turn out to be irrelevant in view of the fact that, actually, they gain…
We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…
In this work we consider selling items using a sequential first price auction mechanism. We generalize the assumption of conservative bidding to extensive form games (henceforth optimistic conservative bidding), and show that for both…
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…
Preference Inference involves inferring additional user preferences from elicited or observed preferences, based on assumptions regarding the form of the user's preference relation. In this paper we consider a situation in which…
We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…
In a very celebrated paper A. Connes has formulated a conjecture which is now one of the most important open problem in Operator Algebras. This importance comes from the works of many mathematicians who have found some unexpected equivalent…
A protocol-independent secrecy theorem is established and applied to several non-trivial protocols. In particular, it is applied to protocols proposed for protecting the computation results of free-roaming mobile agents doing comparison…
Within the Kolmogorov theory of probability, Bayes' rule allows one to perform statistical inference by relating conditional probabilities to unconditional probabilities. As we show here, however, there is a continuous set of alternative…
Associated to a newform $f(z)$ is a Dirichlet series $L_f(s)$ with functional equation and Euler product. Hecke showed that if the Dirichlet series $F(s)$ has a functional equation of a particular form, then $F(s)=L_f(s)$ for some…