Related papers: The converse envelope theorem
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…
Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…
The famous equivalence theorem is reexamined in order to make it applicable to the case of intrinsically quantum infinite-component effective theories. We slightly modify the formulation of this theorem and prove it basing on the notion of…
Isabelle is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a meta-logic (or `logical framework') in…
Agreement theorems are no-go results about rational disagreement: if two agents start from a common prior and their posterior beliefs are common knowledge, they cannot assign different probabilities to the same event. Standard treatments of…
We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…
In this note we prove a converse of Bohr's equivalence theorem for Dirichlet series under some natural assumptions.
The paper considers trading with proportional transaction costs. We give a necessary and sufficient condition for A, the cone of claims attainable from zero endowment, to be closed, and show, in general, how to represent its closure in such…
We formalize an allocation model under ordinal preferences that is more general than the well-studied Shapley-Scarf housing market. In our model, the agents do not just care which house or resource they get but also care about who gets…
We present more than 50 results including some range inclusion results to characterize reverse order law for Moore-Penrose inverse of closed range Hilbert space operators. We use basic properties of Moore-Penrose inverse to prove the…
In three papers Colbeck and Renner (Nature Communications 2:411, (2011); Phys. Rev. Lett. 108, 150402 (2012); arXiv:1208.4123) argued that "no alternative theory compatible with quantum theory and satisfying the freedom of choice assumption…
In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension…
Given two sets of data which lead to a similar statistical conclusion, the Simpson Paradox describes the tactic of combining these two sets and achieving the opposite conclusion. Depending upon the given data, this may or may not succeed.…
We show that there is a $\beta$-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a $\Pi^1_2$-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
We provide conditions under which the union of two first-order theories has the amalgamation property.
We prove that every ordered partial action of an inverse semigroupoid on a partially ordered set admits a globalization. This result is used to establish a connection between ordered partial actions of groupoids and a multi-object analogue…
E prover is a state-of-the-art theorem prover for first-order logic with equality. E prover is built around a saturation loop, where new clauses are derived by inference rules from previously derived clauses. Selection of clauses for the…
Referring to a standard context of voting theory, and to the classic notion of voting situation, here we show that it is possible to observe any arbitrary set of elections' outcomes, no matter how paradoxical it may appear. On this purpose…