Related papers: A ccc indestructible construction with CH
If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…
The oracle c.c.c. is closely related to Cohen forcing. During an iteration we can ``omit a type''; i.e. preserve ``the intersection of a given family of Borel sets of reals is empty'' provided that Cohen forcing satisfies it. We generalize…
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let $\Sigma$ be a language consisting of function symbols (representing type constructors) and $C$ a decidable structure in the relational…
Let $C^{pr}_m$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $C^{pr}_m$ is hereditarily undecidable.
We introduce here Cartesian splines or, for short, C-splines. C- splines are piecewise polynomials which are defined on adjacent Cartesian coordinate systems and are Cr continuous throughout. The Cr continuity is enforced by constraining…
To each finite Coxeter system (W,S) and to each weight function L, Lusztig has defined the notions of constructible characters and of Lusztig families of W, using the so-called J-induction. Whenever L is constant, and using a general…
We generalize a result of Serre's to show that if every vertex of some fixed type of a convex subcomplex of an irreducible spherical building has an opposite, then the subcomplex is completely reducible.
We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting…
Using the moduli space of semiorthogonal decompositions in a smooth projective family, introduced by the second, the third and the fourth author, we propose a novel approach to indecomposability questions for derived categories. Modulo a…
We establish the validity of a strong unique continuation property for weakly coupled elliptic systems, including competitive ones. Our proof exploits the system structure and uses Carleman estimates. We apply this result to obtain some…
In this short note, we prove several infinite family of congruences for some restricted partitions introduced by Pushpa and Vasuki (2022) (thereby, also proving a conjecture of Dasappa et. al. (2023)). We also prove some isolated…
In this paper, we study the homogeneous components of the Chern--Schwartz--MacPherson (CSM) classes of Schubert cells. We prove that, under suitable conditions, each such component is represented by an irreducible subvariety. In particular,…
We show that positivity of the CM line associated to a family of polarised varieties is intimately related to the stability of its members. We prove that the CM line is nef on any curve which meets the stable locus, and that it is…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha<lambda) of distinct elements such that |(eta_alpha+B) cap…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
One way to study the physical plausibility of closed timelike curves (CTCs) is to examine their computational power. This has been done for Deutschian CTCs (D-CTCs) and post-selection CTCs (P-CTCs), with the result that they allow for the…
Small forcing always ruins the indestructibility of an indestructible supercompact cardinal. In fact, after small forcing, any cardinal $\kappa$ becomes superdestructible---any further ${<}\kappa$-closed forcing which adds a subset to…
We investigate the notion of productive cellularity of arbitrary posets and topological spaces. Particularly, by working with families of antichains ordered with reverse inclusion, we give necessary and sufficient conditions to determine…
We introduce and study a multiplicative analogue of additive indecomposability for linear order types that we call untranscendability, as well as a strengthening that we call $s$-untranscendability. We show that, with the unique exception…