相关论文: On regular reduced products
Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent models for regular functions. In this paper, we show that every regular function, either on finite words or on…
The notion of a \textbf{$\boldsymbol{\mathcal{C}}$-filtered} object, where $\mathcal{C}$ is some (typically small) collection of objects in a Grothendieck category, has become ubiquitous since the solution of the Flat Cover Conjecture…
We consider the smallest subring $D$ of $\mathbb{R}(X)$ containing every element of the form $1/(1+x^2)$, with $x\in \mathbb{R}(X)$. $D$ is a Pr\"ufer domain called the minimal Dress ring of $\mathbb{R}(X)$. In this paper, addressing a…
Let $G_{\lambda}^{(\alpha,\beta)}$ be the eigenfunctions of the Dunkl-Cherednik operator $T^{(\alpha,\beta)}$ on $\mathbb{R}$. In this paper we express the product $G_{\lambda}^{(\alpha,\beta)}(x)G_{\lambda}^{(\alpha,\beta)}(y)$ as an…
Consider an $L^2$-normalized Laplace-Beltrami eigenfunction $e_\lambda$ on a compact, boundary-less Riemannian manifold with $\Delta e_\lambda = -\lambda^2 e_\lambda$. We study eigenfunction triple products \[ \langle e_\lambda e_\mu, e_\nu…
Let P be a semigroup that admits an embedding into a group G. Assume that the embedding satisfies a certain Toeplitz condition and that the Baum-Connes conjecture holds for G. We prove a formula describing the K- theory of the reduced…
Lambda-calculi come with no fixed evaluation strategy. Different strategies may then be considered, and it is important that they satisfy some abstract rewriting property, such as factorization or normalization theorems. In this paper we…
In this paper, we consider the normalized Bessel function of index $\alpha > -\frac{1}{2}$, we find an integral representation of the term $x^nj_{\alpha+n}(x)j_\alpha(y)$. This allows us to establish a product formula for the generalized…
Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…
We describe the prime ideals and, in particular, the maximal ideals in products $R = \prod D_\lambda$ of families $(D_\lambda)_{\lambda \in \Lambda}$ of commutative rings. We show that every maximal ideal is induced by an ultrafilter on the…
We generalize the Hart-Shelah example \cite{HaSh:323} to higher infinitary logics. We build, for each natural number $k\geq 2$ and for each infinite cardinal $\lambda$, a sentence $\psi_k^\lambda$ of the logic $L_{(2^\lambda)^+,\omega}$…
We define the notion of a $\lambda$-definable category, a generalisation of the notion of definable category from the model theory of modules. Let ${\cal C}$ be a $\lambda$-accessible additive category. We characterise the additive functors…
Let lambda be an infinite cardinal number and let C = {H_i| i in I} be a family of nontrivial groups. Assume that |I|<=lambda, |H_i|<= lambda, for i in I, and at least one member of C achieves the cardinality lambda. We show that there…
Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications between $\Pi^1_2$ principles over $\omega$-models of…
Roitman's combinatorial principle $\Delta$ is equivalent to monotone normality of the nabla product, $\nabla (\omega +1)^\omega$. If $\{ X_n : n\in \omega\}$ is a family of metrizable spaces and $\nabla_n X_n$ is monotonically normal, then…
The formal system $\lambda\delta$ is a typed lambda calculus derived from $\Lambda_\infty$, aiming to support the foundations of Mathematics that require an underlying theory of expressions (for example the Minimal Type Theory). The system…
We propose a novel and simple method for semi-supervised text classification. The method stems from the hypothesis that a classifier with pretrained word embeddings always outperforms the same classifier with randomly initialized word…
The confluence of untyped \lambda-calculus with unconditional rewriting is now well un- derstood. In this paper, we investigate the confluence of \lambda-calculus with conditional rewriting and provide general results in two directions.…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah math.LO/0407498 and studied also in math.LO/0605067. We introduce a general scheme of generating a filter on lambda from filters on smaller…
For an abstract elementary class $\mathbf{K}$ and a cardinal $\lambda \geq LS(\mathbf{K})$, we prove under mild cardinal arithmetic assumptions, categoricity in two succesive cardinals, almost stability for $\lambda^+$-minimal types and…