Related papers: Strong Homology, Derived Limits, and Set Theory
Let $\mathcal{SN}$ be the $\sigma$-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of $\mathcal{SN}$ after finite support iterations. This is applied…
Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing. Understanding the problem depends on…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…
The extended Hamilton's Principle and other methods proposed to handle non-holonomic constraints are considered. They dont agree with each other. By looking at its consistency with D'Alembert's principle for linear non-holonomic…
Foundation models excel in stable environments, yet often fail where reliability matters most: medicine, finance, and policy. This Fidelity Paradox is not just a data problem; it is structural. In domains where rules change over time, extra…
The generalized allocation scheme is studied. Its extension for coloured balls is defined. Some analogues of the Law of the Iterated Logarithm and the Strong Law of Large Numbers are obtained for the number of boxes containing fixed numbers…
The work is motivated by the papers [Ba1], [Ba2], [Ba7], [Ba11], [Be] and [Be-Tu]. In particular, the strong homology groups of continuous maps were defined and studied in [Be] and [Be-Tu]. To show that given groups are homology type…
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…
We present the notions of positively complete theory and general forms of amalgamation in the framework of positive logic. We explore the fundamental properties of positively complete theories and study the behaviour of companion theories…
We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
It is widely claimed that the natural axiom systems$\unicode{x2013}$including the large cardinal axioms$\unicode{x2013}$form a well-ordered hierarchy. Yet, as is well-known, it is possible to exhibit non-linearity and ill-foundedness by…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
We study the influence of strong forcing axioms on the complexity of the non-stationary ideal on $\omega_2$ and its restrictions to certain cofinalities. Our main result shows that the strengthening $MM^{++}$ of Martin's Maximum does not…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
We introduce a cohomology theory of grading-restricted vertex algebras. To construct the {\it correct} cohomologies, we consider linear maps from tensor powers of a grading-restricted vertex algebra to "rational functions valued in the…
In this note, we give a self-contained account on a construction for a directed homology theory based on modules over algebras, linking it to both persistence homology and natural homology. We study its first properties, among which some…
This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…
String theory contains sources like orientifold planes that support higher derivative interactions. These interactions make possible static flux compactifications which are forbidden in supergravity. They can also lead to violations of the…