Related papers: Subcomplete forcing principles and definable well-…
The classical concept of bounded completeness and its relation to sufficiency and ancillarity play a fundamental role in unbiased estimation, unbiased testing, and the validity of inference in the presence of nuisance parameters. In this…
We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…
Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…
We consider a nonlinear system, affine with respect to an unbounded control $u$ which is allowed to range in a closed cone. To this system we associate a Bolza type minimum problem, with a Lagrangian having sublinear growth with respect to…
In this paper we show how to build a model of $ZFC$ such that all its inner models satisfying the Axiom of Choice are well-ordered with respect to inclusion, and that said ordering is of arbitrary height (including possibly $Ord$ high). We…
We show that there are models of MA where the boldface $\Sigma^1_3$-uniformization property holds. Further we show that BPFA and the assertion $\aleph_1$ is accessible to reals outright implies that the boldface $\Sigma^1_3$-uniformization…
Maximum Principles on unbounded domains play a crucial r\^ole in several problems related to linear second-order PDEs of elliptic and parabolic type. In this paper we consider a class of sub-elliptic operators $\mathcal{L}$ in…
In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…
We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…
We consider semiflows in general Banach spaces motivated by monotone cyclic feedback systems or differential equations with integer-valued Lyapunov functionals. These semiflows enjoy strong monotonicity properties with respect to cones of…
It is shown that the existence of a measurable cardinal is equiconsistent to a model of ZFC in which there is no ordinal-definable, stationary, costationary subset of $\omega_1$
The problem of defining and locating free will (FW) in physics is studied. On basis of logical paradoxes, we argue that FW has a meta-theoretic character, like the concept of truth in Tarski's undefinability theorem. Free will exists…
I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…
It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain…
Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…
Quantum theory allows for the superposition of causal orders between operations, i.e., for an indefinite causal order; an implication of the principle of quantum superposition. Since a higher theory might also admit this feature, an…
We consider a semiflow strongly focusing monotone with respect to a cone of rank k on a Banach space. We prove that the omega-limit set of a pseudo-ordered semiorbit is ordered, which is called as pseudo-ordered principle. Based on this…
The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…
The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…
A forcing poset of size 2^{2^{aleph_1}} which adds no new reals is described and shown to provide a Delta^2_2 definable well-order of the reals (in fact, any given relation of the reals may be so encoded in some generic extension). The…