Related papers: On Recurrence Axioms
We continue our study of maps transforming high-dimensional complicated objects into squares of stationary sets. Previously, we proved that many such transformations exist in ZFC, and here we address the consistency of the strongest…
Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…
We introduce a stronger version of an $\omega_1$-guessing model, which we call an indestructibly $\omega_1$-guessing model. The principle IGMP states that there are stationarily many indestructibly $\omega_1$-guessing models. This…
We focus on a sequence of functions $\{f_n\}$, defined on a compact manifold with boundary $S$, converging in the $C^k$ metric to a limit $f$. A common assumption implicitly made in the empirical sciences is that when such functions…
Take $G$ a locally compact second-countable group, and $H$ a subgroup of $G$. Choose $\mu$ a probability measure on $G$, such that the group spanned by its support is dense in $G$, and consider the Markov chain on the homogeneous space…
Let $\Gamma$ be a weakly irreducible higher rank lattice. In this paper, we will prove various rigidity results for the $\Gamma$-action following a philosophy of the Zimmer program. We provide new rigidity results including local and global…
We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…
We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the…
In the modern Bayesian view classical probability theory is simply an extension of conventional logic, i.e., a quantitative tool that allows for consistent reasoning in the presence of uncertainty. Classical theory presupposes, however,…
We use the core model for sequences of measures to prove a new lower bound for the consistency strength of the failure of the SCH: THEOREM (i) If there is a singular strong limit cardinal $\kappa$ such that $2^\kappa > kappa^+$ then there…
This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…
We study qualitative properties of the set of recurrent points of finitely generated free semigroups of measurable maps. In the case of a single generator the classical Poincare recurrence theorem shows that these properties are closely…
Finsler's lemma is a classic mathematical result with applications in control and optimization. When the lemma is applied to parameter-dependent LMIs, as such those that arise from problems of robust stability, the extra variables…
We present ACCORD, a framework and benchmark suite for disentangling the commonsense grounding and reasoning abilities of large language models (LLMs) through controlled, multi-hop counterfactuals. ACCORD introduces formal elements to…
For the purposes of this paper supercongruences are congruences between terminating hypergeometric series and quotients of $p$-adic Gamma functions that are stronger than those one can expect to prove using commutative formal group laws. We…
We show that the Axiom of Dependent Choices, $\operatorname{DC}$, holds in countably iterable, passive premice $\mathcal{M}$ construced over their reals which satisfy the Axiom of Determinacy, $\operatorname{AD}$, in a…
We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…
In this paper we consider Hopf's Lemma and the Strong Maximum Principle for supersolutions to a class of non elliptic equations. In particular we prove a sufficient condition for the validity of Hopf's Lemma and of the Strong Maximum…
We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…