相关论文: On regular reduced products

We prove that the property Add$(M)\subseteq$ Prod$(M)$ characterizes $\Sigma$-algebraically compact modules if $|M|$ is not $\omega$-measurable. Moreover, under a large cardinal assumption, we show that over any ring $R$ where $|R|$ is not…

We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…

We characterize the compactness properties of the product of \lambda\ copies of the space \omega\ with the discrete topology, dealing in particular with the case \lambda\ singular, using regular and uniform ultrafilters, infinitary…

Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid $M$, it is natural to ask how long a sequence of elements of $M$ needs to be to ensure the…

Let $R$ be a discrete valuation domain with field of fractions $Q$ and maximal ideal generated by $\pi$. Let $\Lambda$ be an $R$-order such that $Q\Lambda$ is a separable $Q$-algebra. Maranda showed that there exists $k\in\mathbb{N}$ such…

Let $\M$ be a hyperfinite finite von Nemann algebra and $(\M_k)_{k\geq 1}$ be an increasing filtration of finite dimensional von Neumann subalgebras of $\M$. We investigate abstract fractional integrals associated to the filtration…

We obtain general criteria for giving a lower bound on the degree of numbers of the form $\prod_{n=1}^\infty \left(1+\frac{b_n}{\alpha_n}\right)$ or of the form $\prod_{m=1}^\infty \left(1+ \sum_{n=1}^\infty…

Let $f$ be a Hecke-Maass cusp form for $\rm SL_2(\mathbb{Z})$ with Laplace eigenvalue $\lambda_f(\Delta)=1/4+\mu^2$ and let $\lambda_f(n)$ be its $n$-th normalized Fourier coefficient. It is proved that, uniformly in $\alpha, \beta \in…

Let $G=GL(m|n)$ be a general linear supergroup over an algebraically closed field $k$ of odd characteristic $p$. In this paper we construct Jantzen filtration of Weyl modules $V(\lambda)$ of $G$ when $\lambda$ is a typical weight in the…

In neural network-based models for natural language processing (NLP), the largest part of the parameters often consists of word embeddings. Conventional models prepare a large embedding matrix whose size depends on the vocabulary size.…

Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has been broadly used as a tool to approximate the terms of several variants of the $\lambda$-calculus. Many results arise from a Commutation…

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles) and the notion of negation is generalized to endomorphisms on this…

We present the system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…

Delimited control operator shift0 exhibits versatile capabilities: it can express layered monadic effects, or equivalently, algebraic effects. Little did we know it can express lambda calculus too! We present $ \Lambda_\$ $, a call-by-value…

We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…

There exist two known canonical types of ultrafilter extensions of first-order models; one comes from modal logic and universal algebra, another one from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as…

A non-deterministic call-by-need lambda-calculus \calc with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost…

Let $R$ be a standard graded algebra over an infinite field $\mathbb{K}$ and $M$ a finitely generated $\ZZ$-graded $R$-module. Let $I_1,\ldots I_m$ be graded ideals of $R$. The functions $r(M/I_1^{a_1}\ldots I_m^{a_m}M)$ and…

Fragments of first-order logic over words can often be characterized in terms of finite monoids, and identities of omega-terms are an effective mechanism for specifying classes of monoids. Huschenbett and the first author have shown how to…