Related papers: On Recurrence Axioms
This paper introduces a new family of cognitive modal logics designed to formalize conjectural reasoning: modal systems in which cognitive contexts extend known facts with hypothetical assumptions in order to explore their consequences.…
The Wholeness Axioms, proposed by Paul Corazza, axiomatize the existence of an elementary embedding j:V-->V. Formalized by augmenting the usual language of set theory with an additional unary function symbol j to represent the embedding,…
Let $\Gamma^\infty$ be the set of all universally Baire sets of reals. Inspired by recent work of the second author and Nam Trang, we introduce a new technique for establishing generic absoluteness results for models containing…
The $A_\infty$ T-system, also called the octahedron recurrence, is a dynamical recurrence relation. It can be realized as mutation in a coefficient-free cluster algebra (Kedem 2008, Di Francesco and Kedem 2009). We define T-systems with…
For a sequence $\gamma=(\gamma_n)_{n\ge 1}$, define \[ L_\gamma(z):=\sum_{n\ge 1}\gamma_n\frac{z^n}{1-z^n} =\sum_{n\ge 1}\Bigl(\sum_{d\mid n}\gamma_d\Bigr)z^n. \] We prove a short rigidity theorem: if $\gamma$ is eventually linearly…
We introduce the resurrection axioms, a new class of forcing axioms, and the uplifting cardinals, a new large cardinal notion, and prove that various instances of the resurrection axioms are equiconsistent over ZFC with the existence of an…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopenka's principle. We prove that the necessary large-cardinal…
We present an impossibility result, called a theorem about facts and words, which pertains to a general communication system. The theorem states that the number of distinct words used in a finite text is roughly greater than the number of…
We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as probability measures, belief functions, and possibility…
We introduce a unified geometric framework for domains satisfying a geometric normal property (C-GNP) relative to a strictly convex set \(C\). Under the fundamental assumption that the source \(f\) is supported within the core \(C\), we…
This paper is about the surprising interaction of a foundational result from model theory, about stability of theories, with algorithmic stability in learning. First, in response to gaps in existing learning models, we introduce a new…
We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…
We study various classes of maximality principles, $\rm{MP}(\kappa,\Gamma)$, introduced by J.D. Hamkins, where $\Gamma$ defines a class of forcing posets and $\kappa$ is a cardinal. We explore the consistency strength and the relationship…
We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…
Agreement tests are a generalization of low degree tests that capture a local-to-global phenomenon, which forms the combinatorial backbone of most PCP constructions. In an agreement test, a function is given by an ensemble of local…
We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular…
Large Language Models (LLMs) have demonstrated significant promise in formal theorem proving. In this study, we investigate the ability of LLMs to discover novel theorems and produce verified proofs. We propose a pipeline called…
The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…
Many automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to simplify the subgoals that arise during a proof. LCF is an interactive theorem-prover intended for reasoning about computation. Its implementation of…