Related papers: The Rigid Relation Principle, a New Weak Choice Pr…

The best developed formulation of closed system quantum theory that handles multiple-time statements, is the consistent (or decoherent) histories approach. The most important weaknesses of the approach is that it gives rise to many…

A logic for specification and verification is derived from the axioms of Zermelo-Fraenkel set theory. The proofs are performed using the proof assistant Isabelle. Isabelle is generic, supporting several different logics. Isabelle has the…

We study the logical content of several maximality principles related to the finite intersection principle ($F\IP$) in set theory. Classically, these are all equivalent to the axiom of choice, but in the context of reverse mathematics their…

We study weak approximation on rationally connected varieties under an assumption of strong approximation for a "simple" variety or under Schinzel's hypothesis. We also get some unconditional results.

We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the first part of the paper, we give a new proof of Yao's XOR-Lemma…

The current definition of a Bayesian credible set cannot, in general, achieve an arbitrarily preassigned credible level. This drawback is particularly acute for classification problems, where there are only a finite number of achievable…

We prove that any equational basis that defines RRA over wRRA must contain infinitely many variables. The proof uses a construction of arbitrarily large finite weakly representable but not representable relation algebras whose "small"…

In this paper we prove the Rigidity Theorem for motives of rigid analytic varieties over a non-Archimedean valued field $K$. We prove this theorem both for motives with transfers and without transfers in a relative setting. Applications…

We make two observations regarding a recent tight example for a composition theorem for randomized query complexity: (1) it implies general randomized query-to-communication lifting is not always true if one allows relations, (2) it is in a…

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…

The Heisenberg-Robertson uncertainty relation quantitatively expresses the impossibility of jointly sharp preparation of incompatible observables. However it does not capture the concept of incompatible observables because it can be trivial…

We study the restricted category O for an affine Kac--Moody algebra at the critical level. In particular, we prove the first part of the Feigin-Frenkel conjecture: the linkage principle for restricted Verma modules. Moreover, we prove a…

Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…

We utilize quantum superposition principle to establish the improvable upper and lower bounds on the stronger uncertainty relation, i.e., the "weighted-like" sum of the variances of observables. Our bounds include some free parameters which…

We continue the investigation of systems of hereditarily rigid relations started in Couceiro, Haddad, Pouzet and Sch\"olzel [1]. We observe that on a set $V$ with $m$ elements, there is a hereditarily rigid set $\mathcal R$ made of $n$…

We give a level-by-level analysis of the Weak Vop\v{e}nka Principle for definable classes of relational structures (WVP), in accordance with the complexity of their definition, and we determine the large-cardinal strength of each level.…

Let $\mathcal R$ be a $\Sigma^1_1$ binary relation and call a set $\mathcal R$-discrete iff no two distinct of its elements are $\mathcal R$-related. We show that in the extension of $\mathbf{L}$ by iterated Sacks forcing, there is a…

In this discussion we demonstrate that fiducial distributions provide a natural example of an inference paradigm that does not obey Strong Likelihood Principle while still satisfying the Weak Conditionality Principle. [arXiv:1302.7021]

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…

This article offers a gentle introduction to the axiom of choice. We introduce the axiom, discuss some common objections to it, and present three kinds of reasons to accept it. Although the exposition is aimed at non-experts in set theory,…