English
Related papers

Related papers: On the existence property over a predicate

200 papers

In [AGRS] a multiplicity one theorem is proven for general linear groups, orthogonal groups and unitary groups ($GL, O,$ and $U$) over $p$-adic local fields. That is to say that when we have a pair of such groups $G_n\subseteq G_{n+1}$, any…

Representation Theory · Mathematics 2021-06-01 Dor Mezer

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

Logic · Mathematics 2026-02-24 Predrag Tanović

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regarding the effect of the properties of B on the behavior of…

Logic · Mathematics 2022-01-19 Itay Kaplan , Ori Segel , Saharon Shelah

Let G denote a connected, quasi-split reductive group over a field F that is complete with respect to a discrete valuation and that has a perfect residue field. Under mild hypotheses, we produce a subset of the Lie algebra g(F) that picks…

Representation Theory · Mathematics 2019-03-13 Jeffrey D. Adler , Jessica Fintzen , Sandeep Varma

Using a m\'elange of techniques at the rich intersection of deformation/rigidity theory, finite index subfactor theory, and geometric group theory, we prove the existence of a continuum of property (T) factors that are pairwise non-stably…

Operator Algebras · Mathematics 2025-11-11 Ionut Chifan , Junhwi Lim

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

Logic · Mathematics 2016-04-01 Richard Rast

Let G be a connected reductive group defined over a non-archimedean local field of characteristic 0. We assume G is quasi-split, adjoint and absolutly simple. Let g be the Lie algebra of G. We consider the space of the invariant…

Representation Theory · Mathematics 2025-09-15 Jean-Loup Waldspurger

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…

Logic · Mathematics 2007-05-23 John Goodrick

We show that $ZF+DC+$"all Turing invariant sets of reals have the perfect set property" implies that all sets of reals have the perfect set property. We also show that this result generalizes to all countable analytic equivalence relations.

Logic · Mathematics 2020-04-06 Clovis Hamel , Haim Horowitz , Saharon Shelah

We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabitation in an intersection type system P based on…

Logic in Computer Science · Computer Science 2023-06-22 Antonio Bucciarelli , Delia Kesner , Simona Ronchi Della Rocca

We construct a wealth of groups that are finitely presented, Frobenius stable, have property (T), but are very far from having property (T$_2$). Our method also shows that property (T$_2$) does not pass to quotients.

Group Theory · Mathematics 2025-12-11 Francesco Fournier-Facio

We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…

Logic · Mathematics 2026-02-24 Slavko Moconja , Predrag Tanović

Countably infinite groups (with a fixed underlying set) constitute a Polish space $G$ with a suitable metric, hence the Baire category theorem holds in $G$. We study isomorphism invariant subsets of $G$, which we call group properties. We…

We characterize stable T for which the model completion of T_{aut} is stable (i.e., every completion is). Then we prove that ``some completion is stable'' is different and we characterize it. Finally we show that if T is stable, T_{aut} has…

Logic · Mathematics 2007-05-23 Saharon Shelah

We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…

Logic · Mathematics 2024-06-18 Gabriel Conant , Anand Pillay

We characterize those complete commutative positive linear ordered monoids $W$ such that whenever $f$ is a map from a Cauchy complete $W$-metric space to itself, the existence of a fixed point of $f$ is independent of the background model…

General Topology · Mathematics 2025-04-15 Nathanael Ackerman , Mostafa Mirabi

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

Number Theory · Mathematics 2016-02-08 Tigran Hakobyan

A $G$-invariant version of definable Tietze extension theorem for definably complete structures is proved when a definably compact definable topological group $G$ acts definably and continuously on the definable set.

Logic · Mathematics 2026-01-09 Masato Fujita , Tomohiro Kawakami

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

Logic · Mathematics 2016-09-07 Carsten Butz , Ieke Moerdijk

We characterize the set of properties of Boolean-valued functions on a finite domain $\mathcal{X}$ that are testable with a constant number of samples. Specifically, we show that a property $\mathcal{P}$ is testable with a constant number…

Data Structures and Algorithms · Computer Science 2016-12-20 Eric Blais , Yuichi Yoshida