Related papers: The full basis theorem does not imply analytic wel…
We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…
The main result of the paper is that a system of invariant subspaces of a (completely non-unitary) Hilbert space contraction $T$ with finite defects (rank$(I-T^*T)<\infty$, rank$(I-TT^*)<\infty$) is an unconditional basis (Riesz basis) if…
Motivated by the problem of optimal portfolio liquidation under transient price impact, we study the minimization of energy functionals with completely monotone displacement kernel under an integral constraint. The corresponding minimizers…
We show the consistency of ZFC +''there is no NWD-ultrafilter on omega'', which means: for every non principle ultrafilter D on the set of natural numbers, there is a function f from the set of natural numbers to the reals, such that for…
We show that if $M$ is a countable transitive model of ZF and if $a,b$ are reals not in $M$, then there is a $G$ generic over $M$ such that $b \in L[a,G]$. We then present several applications such as the following: if $J$ is any countable…
We prove consistency of the following sentence: ``ZFC + every real function is continuous on a non-meagre set'', answering a question of Fremlin.
We show that $ZF+DC+$"all Turing invariant sets of reals have the perfect set property" implies that all sets of reals have the perfect set property. We also show that this result generalizes to all countable analytic equivalence relations.
We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…
I introduce an approach for automated reasoning in first order set theories that are not finitely axiomatizable, such as $ZFC$, and describe its implementation alongside the automated theorem proving software E. I then compare the results…
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 study direct product representations of algebras in varieties. We collect several conditions expressing that these representations are "definable" in a first-order-logic sense, among them the concept of Definable Factor Congruences…
We introduce a coinductive version of the well-foundedness of N that is used in our proof within minimal logic of the constructive counterpart CLNP to the standard least number principle LNP. According to CLNP, an inhabited complemented…
In this note, we present an elementary proof for a well-known second-order sufficient optimality condition in nonlinear semidefinite optimization which does not rely on the enhanced theory of second-order tangents. Our approach builds on an…
We prove it consistent relative to ZFC that all nontrivial forcings of size $\aleph _1$ add a Cohen real.
We consider a set-theoretic version of mereology based on the inclusion relation $\subseteq$ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of $\in$ from $\subseteq$, we identify…
We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…
We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from…
One of the most famous results in Complex Analysis is the Little Picard Theorem, that characterizes the image set of an arbitrary entire function. Specifically, the theorem states that this image set is either the whole complex plane or the…
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…
Suppose that a Lie algebra $L$ admits a finite Frobenius group of automorphisms $FH$ with cyclic kernel $F$ and complement $H$ such that the characteristic of the ground field does not divide $|H|$. It is proved that if the subalgebra…