Related papers: A note on a new ideal

We study the order theoretic properties of relative weak injectivity, w.r.i., in short, in the category of C*-algebras. We prove that Arveson's extension theorem, with additional order assumption on the morphisms, is tightly connected with…

A weakening of sequential rationality of sequential equilibrium yields Reny's (1992) weakly sequentially rational equilibrium (WSRE) in extensive-form games. WSRE requires Kreps and Wilson's (1982) consistent assessment to satisfy global…

A family I of subsets of a set X is an ideal on X if it is closed under taking subsets and finite unions of its elements. An ideal I on X is below an ideal J on Y in the Katetov order if there is a function $f:Y\to X$ such that…

In a recent paper, Schenck and Seceleanu showed that in three variables, any ideal generated by powers of linear forms has the Weak Lefschetz Property (WLP). This result contrasts with examples, in our previous work, of ideals in four…

The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…

The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…

In this work, we investigate various combinatorial properties of Borel ideals on countable sets. We extend a theorem presented in M. Hru\v{s}\'{a}k, D. Meza-Alc\'antara, E. Th\"ummel, and C. Uzc\'ategui, \emph{Ramsey Type Properties of…

The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…

In this paper, we introduce a new generalization of weakly prime ideals called $I$-prime. Suppose $R$ is a commutative ring with identity and $I$ a fixed ideal of $R$. A proper ideal $P$ of $R$ is $I$-prime if for $a, b \in R$ with $ab \in…

Let $n\in\omega$. The weak choice principle $\operatorname{RC}_n$ states that for every infinite set $x$ there is an infinite subset $y\subseteq x$ with a choice function on $[y]^n:=\{z\subseteq y\mid \lvert z\rvert =n\}$.…

We introduce weak exceptional sequence of modules which can be viewed as another modification of the standard case, different than the works of Igusa-Todorov \cite{Igusa-Todorov} and Buan-Marsh \cite{Buan-Marsh}. For hereditary algebras it…

Let $R$ be a commutative ring with non-zero identity. In this paper, we introduce the concept of weakly $J$-ideals as a new generalization of $J$-ideals. We call a proper ideal $I$ of a ring $R$ a weakly $J$-ideal if whenever $a,b\in R$…

With each of the usual tree forcings I (e.g., I = Sacks forcing S, Laver forcing L, Miller forcing M, Mathias forcing R, etc.) we associate a sigma--ideal i^0 on the reals as follows: A \in i^0 iff for all T \in I there is S \leq T (i.e. S…

(English) This monograph aims at presenting the core weak convergence theory for sequences of random vectors with values in $\mathbb{R}^k$. In some places, a more general formulation in metric spaces is provided. It lays out the necessary…

Selective ultrafilters are characterized by many equivalent properties, in particular the Ramsey property that every finite colouring of unordered pairs of integers has a homogeneous set in U, and the equivalent property that every function…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

We describe some basic facts about the weak subintegral closure of ideals in both the algebraic and complex-analytic settings. We focus on the analogy between results on the integral closure of ideals and modules and the weak subintegral…

In this paper, we propose a weak regularity principle which is similar to both weak K\"onig's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then…

Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some…

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…