Related papers: Canonical models for aleph_1 combinatorics

We define a notion of ideal for objects in the category of abstract unitary Cuntz semigroups introduced in [3] and termed Cu$^\sim$. We show that the set of ideals of a Cu$^\sim$-semigroup has a complete lattice structure. In fact, we prove…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

We prove that if $\pi$ is a recursive set of primes, then pointlike sets are decidable for the pseudovariety of semigroups whose subgroups are $\pi$-groups. In particular, when $\pi$ is the empty set, we obtain Henckell's decidability of…

We investigate a hierarchy of arithmetical structures obtained by a transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as a minimum universal predicate for M in terms of…

Canonical quantization has served wonderfully for the quantization of a vast number of classical systems. That includes single classical variables, such as $p$ and $q$, and numerous classical Hamiltonians $H(p,q)$, as well as field…

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

We identify an interesting special class of prime ideals in the finitary infinite symmetric group algebra. We show that the set of such ideals carries a semiring structure. Over the complex numbers, we establish a connection with spherical…

The paper is concerned with the existence of a universal graph at the successor of a strong limit singular mu of cofinality aleph_0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for…

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…

Let G be a reductive group over an algebraically closed field of characteristic p, and let u in G be a unipotent element of order p. Suppose that p is a good prime for G. We show in this paper that there is a homomorphism phi:SL_2/k --> G…

We examine canonical bases for weakly holomorphic modular forms of weight $0$ and level $p = 2, 3, 5, 7, 13$ with poles only at the cusp at $\infty$. We show that many of the Fourier coefficients for elements of these canonical bases are…

This paper is an extended version of our work in \cite{Ca2025}. We extend the concept of effective reducibility between statements of set theory with ordinal Turing machines (OTMs) explored in \cite{Ca2018} for $\Pi_{2}$-statements to…

In this paper we prove theorems that describe how the representation theory of the affine Hecke algebra of type A and of related algebras such as the group algebra of the symmetric group are controlled by integrable highest weight…

We prove the consistency of the following statement: for some kappa<2^{aleph_0}, there is a kappa-complete ideal on kappa such that the Boolean algebra P(kappa)/I is sigma-centered and there are Q-sets of reals.

We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…

In various models of set theory, we consider covering Aleph_1 x Aleph_1 rectangles by countably many smooth curves, and we study differentiable isomorphisms between Aleph_1-dense sets of reals.

In this paper, we argue that formal systems of first order Arithmetic that admit Goedelian undecidable propositions validly are abnormally non-constructive. We argue that, in such systems, the strong representation of primitive recursive…

For $K$ an abstract elementary class with amalgamation and no maximal models, we show that categoricity in a high-enough cardinal implies structural properties such as the uniqueness of limit models and the existence of good frames. This…

For an ideal of a regular $\cc$-algebra, its Bernstein-Sato polynomial is the monic polynomial of the lowest degree satisfying an Bernstein-Sato functional equation. We generalize the notion of Bernstein-Sato functional equations to the…