Related papers: Variants on the Berz sublinearity theorem
The theory of classical realizability is a framework for the Curry-Howard correspondence which enables to associate a program with each proof in Zermelo-Fraenkel set theory. But, almost all the applications of mathematics in physics,…
This paper develops a more general theory of sequences of dependent categorical random variables, extending the works of Korzeniowski (2013) and Traylor (2017) that studied first-kind dependency in sequences of Bernoulli and categorical…
The Axiom of Choice (AC for short) is the most (in)famous axiom of the usual foundations of mathematics, ZFC set theory. The (non-)essential use of AC in mathematics has been well-studied and thoroughly classified. Now, fragments of…
Zorn's Lemma is a well-known equivalent of the Axiom of Choice. It is usually regarded as a topic in axiomatic set theory, and its historically standard proof (from the Axiom of Choice) relies on transfinite recursion, a non-elementary…
This paper presents two types of results related to hyperarithmetic analysis. First, we introduce new variants of the dependent choice axiom, namely $\mathrm{unique}~\Pi^1_0(\mathrm{resp.}~\Sigma^1_1)\text{-}\mathsf{DC}_0$ and…
We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…
We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type…
We examine versions of the classical inequalities of Paley and Zygmund for functions of several variables. A sharp multiplier inclusion theorem and variants on the real line are obtained.
In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…
The aim of this article is to obtain variations on the classical theorems of Schur and Baer on finiteness of commutator subgroups, valid in the contexts of Lie algebras and Leibniz algebras over a field. Using non-abelian tensor products…
A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…
Based on conditional set theory, we study conditional weak topologies, extending some well-known results to this framework and culminating with the proof of conditional versions of Eberlein-\v{S}mulian and Amir-Lindenstrauss Theorems. In…
Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…
Classical Decision Theory provides a normative framework for representing and reasoning about complex preferences. Straightforward application of this theory to automate decision making is difficult due to high elicitation cost. In response…
We consider the problem of rationalizing choice data by a preference satisfying an arbitrary collection of invariance axioms. Examples of such axioms include quasilinearity, homotheticity, independence-type axioms for mixture spaces,…
In this paper, we give a Breiman's theorem for conditional dependent random vector, where one component has a regularly-varying-tailed distribution with the index $\alpha\ge0$ and its slowly varying function satisfies a relaxed condition,…
This paper investigates a purely qualitative version of Savage's theory for decision making under uncertainty. Until now, most representation theorems for preference over acts rely on a numerical representation of utility and uncertainty…
The aim of this paper is to study variation detracting property and con- vergence in variation of the Bernstein-Durrmeyer modifications of the classical Bernstein operators in the space of functions of bounded variation. These problems are…
There is no single canonical polynomial-time version of the Axiom of Choice (AC); several statements of AC that are equivalent in Zermelo-Fraenkel (ZF) set theory are already inequivalent from a constructive point of view, and are similarly…
In this paper I present an (\in, =)-sentence, AC**, with only 5 quantifiers, that logically implies the axiom of choice, AC. Furthermore, using a weak fragment of ZF set theory, I prove that AC implies AC**. Up to now 6 quantifiers were the…