English
Related papers

Related papers: A remark on strict independence relations

200 papers

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be an equivalence relation (and thus transitive). It is shown…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…

Combinatorics · Mathematics 2025-10-14 Nataly Brukhim , Ariel Bruner , Orit E. Raz

This paper deals with an open problem posed by Jleli and Samet in \cite[\, M.~Jleli and B.~Samet, On a new generalization of metric spaces, J. Fixed Point Theory Appl, 20(3) 2018]{JS1}. In \cite[\, Remark 5.1]{JS1} They asked whether the…

General Topology · Mathematics 2019-03-26 Sumit Som , Lakshmi Kanta Dey

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…

Logic · Mathematics 2011-06-24 Joel David Hamkins , Justin Palumbo

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…

Logic · Mathematics 2015-04-24 Tarek Sayed Ahmed

A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…

Logic · Mathematics 2021-02-03 Amador Martin-Pizarro , Martin Ziegler

Let $R$ be an excellent Noetherian ring of prime characteristic. Consider an arbitrary nested pair of ideals (or more generally, a nested pair of submodules of a fixed finite module). We do \emph{not} assume that their quotient has finite…

Commutative Algebra · Mathematics 2011-03-25 Neil Epstein , Yongwei Yao

Assuming Schanuel's conjecture, we prove that the complete theory $T_{\exp}$ of the real exponential field is axiomatized by the axioms of definably complete exponential fields satisfying $\exp' = \exp$. This implies the result of Macintyre…

Logic · Mathematics 2026-03-10 Alessandro Berarducci , Francesco Gallinaro

We study the spectrum of limit models assuming the existence of a nicely behaved independence notion. Under reasonable assumptions, we show that all `long' limit models are isomorphic, and all `short' limit models are non-isomorphic.…

Logic · Mathematics 2025-10-17 Jeremy Beard , Marcos Mazari-Armida

We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…

Logic in Computer Science · Computer Science 2014-06-03 Tony Tan , Jan Van den Bussche , Xiaowang Zhang

Using Y.Andr\'e's result on differential equations staisfied by $E$-functions, we derive an improved version of the Siegel-Shidlovskii theorem. It gives a complete characterisation of algebraic relations over the algebraic numbers between…

Number Theory · Mathematics 2007-05-23 F. Beukers

Federer's characterization states that a set $E\subset \mathbb{R}^n$ is of finite perimeter if and only if $\mathcal H^{n-1}(\partial^*E)<\infty$. Here the measure-theoretic boundary $\partial^*E$ consists of those points where both $E$ and…

Metric Geometry · Mathematics 2020-01-08 Panu Lahti

We study a measure-theoretic notion of connectedness for sets of finite perimeter in the setting of doubling metric measure spaces supporting a weak $(1,1)$-Poincar\'{e} inequality. The two main results we obtain are a decomposition theorem…

Metric Geometry · Mathematics 2019-07-26 Paolo Bonicatto , Enrico Pasqualetto , Tapio Rajala

This article introduces a weak pseudo-inverse of a monotone function, which is applied to characterize the associativity of a two-place function $T: [0,1]^2\rightarrow [0,1]$ defined by $T(x,y)=t^{[-1]}(F(t(x),t(y)))$ where…

General Mathematics · Mathematics 2025-07-08 Meng Chen , Xue-ping Wang

Suppose $T$ is totally transcendental and every minimal non-locally-modular type is nonorthogonal to a nonisolated minimal type over the empty set. It is shown that a finite rank type $p=tp(a/A)$ is isolated if and only if $a$ is…

Logic · Mathematics 2018-10-10 Omar León Sánchez , Rahim Moosa

'Skolem arithmetic' is the complete theory $T$ of the multiplicative monoid $(\mathbb{N},\cdot)$. We give a full characterization of the $\varnothing$-definable stably embedded sets of $T$, showing in particular that, up to the relation of…

Logic · Mathematics 2021-09-03 Atticus Stonestrom

We consider the unitary group $\U$ of complex, separable, infinite-dimensional Hilbert space as a discrete group. It is proved that, whenever $\U$ acts by isometries on a metric space, every orbit is bounded. Equivalently, $\U$ is not the…

Functional Analysis · Mathematics 2007-05-23 Eric Ricard , Christian Rosendal

Using class field theory, we prove a restriction on the intersection of the maximal abelian extensions associated with different number fields. This restriction is then used to improve a result of Rosen and Silverman about the linear…

Number Theory · Mathematics 2017-11-28 Lars Kühne

The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the…

Combinatorics · Mathematics 2007-05-23 Yair Bartal , Nathan Linial , Manor Mendel , Assaf Naor