相关论文: Relative Definability of $n$-Generics

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given…

This paper describes a new link between combinatorial number theory and geometry. The main result states that A is a finite set of relatively prime positive integers if and only if A = (K-K) \cap N, where K is a compact set of real numbers…

We prove that in a regular category all reflexive and transitive relations are symmetric if and only if every internal category is an internal groupoid. In particular, these conditions hold when the category is n-permutable for some n.

The Ramsey Choice principle for families of $n$-element sets, denoted $\mathrm{RC}_n$, states that every infinite set $X$ has an infinite subset $Y\subseteq X$ with a choice function on $[Y]^n := \{z\subseteq Y : |z| = n\}$. We investigate…

Theorem: Let $n\ge 2.$ There is a CCC in $L$ forcing notion $P=P_n\in L$ such that $P$-generic extensions of $L$ are of the form $L[a],$ where $a\subseteq\omega$ and 1) $a$ is $\Delta^1_{n+1}$ in $L[a]$; and 2) if $b\in L[a],$…

Let $S$ be a Scott set, or even an $\omega$-model of $\mathsf{WWKL}$. Then for each $A\in S$, either there is $X \in S$ that is weakly 2-random relative to $A$, or there is $X\in S$ that is 1-generic relative to $A$. It follows that if…

A collection $\mathcal S$ of equivalence classes of positive definite integral quadratic forms in $n$ variables is called an $n$-exceptional set if there exists a positive definite integral quadratic form which represents all equivalence…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

We prove that if a level set of a degree $n$ general inverse $\sigma_k$ equation $f(\lambda_1, \cdots, \lambda_n) = \lambda_1 \cdots \lambda_n - \sum_{k = 0}^{n-1} c_k \sigma_k(\lambda) = 0$ is contained in $q + \Gamma_n$ for some $q \in…

The Hanna Neumann conjecture states that if F is a free group, then for all finitely generated subgroups H,K <= F, rank(H intersect K) - 1 <= [ rank(H)-1 ] [ rank(K)-1 ] In this paper, we show that if one of the subgroups, say H, has a…

The strong recurrence is equivalent to the Riemann hypothesis. On the other hand, the generalized strong recurrence holds for any irrational number. In this paper, we show the generalized strong recurrence for all non-zero rational numbers.…

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

This article examines the formula G (of Goedel). We demonstrated that the Goedel's number of the formula G is not a finite number if (i) G is comprehended as a self-referential statement or (ii) there is an infinite set S of well-formed…

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

A subset $X$ of an abelian $G$ is said to be {\em complete} if every element of the subgroup generated by $X$ can be expressed as a nonempty sum of distinct elements from $X$. Let $A\subset \Z_n$ be such that all the elements of $A$ are…

Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…

If $G$ is an abelian group, we say $S\subset G$ is a set of recurrence if for every probability measure preserving $G$-system $(X,\mu,T)$ and every $D\subset X$ having $\mu(D)>0$, there is a $g\in S$ such that $\mu(D\cap T^{g}D)>0$. We say…