Related papers: Consistency Strengths of Modified Maximality Princ…
A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated to arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the…
In the first part of the paper, we show that if $\omega \le \kappa < \lambda$ are cardinals, $\kappa^{<\kappa} = \kappa$, and $\lambda$ is weakly compact, then in $V[\M(\kappa,\lambda)]$ the tree property at $\lambda =…
For $\lambda$ inaccessible, we may consider $(< \lambda)$-support iteration of some specific $(<\lambda)$-complete $\lambda^+$-c.c. forcing notion. But this fails a "preservation by restricting to a sub-sequence of the forcing, we "correct"…
We present a theoretical framework of probabilistic learning derived by Maximum Probability (MP) Theorem shown in the current paper. In this probabilistic framework, a model is defined as an event in the probability space, and a model or…
To take advantage of Large Language Model in theorem formalization and proof, we propose a reinforcement learning framework to iteratively optimize the pretrained LLM by rolling out next tactics and comparing them with the expected ones.…
When deploying artificial agents in real-world environments where they interact with humans, it is crucial that their behavior is aligned with the values, social norms or other requirements of that environment. However, many environments…
We present new, streamlined proofs of certain maximality principles studied by Hamkins and Woodin. Moreover, we formulate an intermediate maximality principle, which is shown here to be equiconsistent with the existence of a weakly compact…
Empirical causal claims depend on many analyst decisions, from selecting covariates to choosing estimators. Existing robustness tools summarize how results vary across these choices, but, to the best of our knowledge, do not answer:…
Reinforcement learning (RL) has traditionally been understood from an episodic perspective; the concept of non-episodic RL, where there is no restart and therefore no reliable recovery, remains elusive. A fundamental question in…
In this paper, we propose to study the following maximum ordinal consensus problem: Suppose we are given a metric system (M, X), which contains k metrics M = {\rho_1,..., \rho_k} defined on the same point set X. We aim to find a maximum…
We investigate the interaction between compactness principles and guessing principles in the Radin forcing extensions. In particular, we show that in any Radin forcing extension with respect to a measure sequence on $\kappa$, if $\kappa$ is…
We show that $\mathsf{PFA}$ implies that the tightness $t(X_\delta)$ of the $G_\delta$-modification of a Fr\'echet $\alpha_1$-space $X$ is at most $\omega_1$, while $\Box(\kappa)$ implies that there is a Fr\'echet $\alpha_1$-space with…
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…
A new method of deriving comparative statics information using generalized compensated derivatives is presented which yields constraint-free semidefiniteness results for any differentiable, constrained optimization problem. More generally,…
Maximal repetition of a string is the maximal length of a repeated substring. This paper investigates maximal repetition of strings drawn from stochastic processes. Strengthening previous results, two new bounds for the almost sure growth…
The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…
This paper presents a verification framework based on a new class of predicate Constraint Satisfaction Problems called pCSP where constraints are represented as clauses modulo first-order theories over function variables and predicate…
We consider partially observable Markov decision processes (POMDPs) with {\omega}-regular conditions specified as parity objectives. The class of {\omega}-regular languages extends regular languages to infinite strings and provides a robust…
We study the optimization version of constraint satisfaction problems (Max-CSPs) in the framework of parameterized complexity; the goal is to compute the maximum fraction of constraints that can be satisfied simultaneously. In standard…
For $n<\omega$, we say that the $\Pi^1_n$-reflection principle holds at $\kappa$ and write $\text{Refl}_n(\kappa)$ if and only if $\kappa$ is a $\Pi^1_n$-indescribable cardinal and every $\Pi^1_n$-indescribable subset of $\kappa$ has a…