Related papers: Subcomplete forcing principles and definable well-…
We construct a weakly compact convex subset of $\ell^2$ with nonempty interior that has an isolated maximal element, with respect to the lattice order $\ell _+^2$. Moreover, the maximal point cannot be supported by any strictly positive…
We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…
The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…
We show that every strictly pseudoconvex domain $\Omega$ with smooth boundary in a complex manifold $\mathcal{M}$ admits a global defining function, i.e., a smooth plurisubharmonic function $\varphi \colon U \to \mathbb R$ defined on an…
A refined version of the strong maximum principle is proven for a class of second order ordinary differential equations with possibly discontinuous non-monotone nonlinearities. Then, exploiting this tool, some optimal regularity results…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally…
For a Banach space $X$ its subset $Y\subseteq X$ is called overcomplete if $|Y|=dens(X)$ and $Z$ is linearly dense in $X$ for every $Z\subseteq Y$ with $|Z|=|Y|$. In the context of nonseparable Banach spaces this notion was introduced…
It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
We prove under $V=L$ that the inclusion modulo the non-stationary ideal is a $\Sigma_1^1$-complete quasi-order in the generalized Borel-reducibility hierarchy ($\kappa>\omega$). This improvement to known results in $L$ has many new…
Let $(\Omega,\Sigma,\mu)$ be a measure space and $1< p < +\infty$. In this paper we show that, under quite general conditions, the set $L_{p}(\Omega) - \bigcup\limits_{1 \leq q < p}L_{q}(\Omega)$ is maximal spaceable, that is, it contains…
The principle which allows to construct new physical theories on the basis of classical mechanics by reduction of the number of its axiom without engaging new postulates is formulated. The arising incompleteness of theory manifests itself…
A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…
We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…
Assuming the P-ideal dichotomy, we attempt to isolate those cardinal characteristics of the continuum that are correlated with two well-known consequences of the proper forcing axiom. We find a cardinal invariant $\mathfrak{x}$ such that…
A description of physical reality in which wholeness is the foundation is discussed along with the motivation for such an attempt. As a possible mathematical framework within which a physical theory based on wholeness may be expressed,…
We provide a generalization of first-order necessary conditions of optimality for infinite-dimensional optimization problems with a finite number of inequality constraints and with a finite number of inequality and equality constraints. Our…
Many results on the convex order in the literature were stated for random variables with finite mean. For instance, a fundamental result in dependence modeling is that the sum of a pair of random random variables is upper bounded in convex…
We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…