Related papers: On the existence property over a predicate
We introduce a notion of topological property (T) for \'etale groupoids. This simultaneously generalizes Kazhdan's property (T) for groups and geometric property (T) for coarse spaces. One main goal is to use this property (T) to prove the…
A fundamental question is whether Turing machines can model all reasoning processes. We introduce an existence principle stating that the perception of the physical existence of any Turing program can serve as a physical causation for the…
The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…
The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map…
In this paper we prove a sufficient condition for the existence of matchings in arbitrary groups and its linear analogue, which lead to some generalizations of the existing results in the theory of matchings in groups and central extensions…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…
We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…
For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory…
We prove that the notion of relative property (T) (or rigidity) for inclusions of finite von Neumann algebras defined in [Po1] is equivalent to a weaker property, in which no ``continuity constants'' are required. The proof is by…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
Given the family $P$ of all nonempty subsets of a set $U$ of alternatives, a choice over $U$ is a function $c \colon \Omega \to P$ such that $\Omega \subseteq P$ and $c(B) \subseteq B$ for all menus $B \in \Omega$. A choice is total if…
Let T be a complete first order theory in a countable relational language L . We assume relation symbols have been added to make each formula equivalent to a predicate. Adjoin a new unary function symbol sigma to obtain the language…
The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…
Let $k$ be an uncountable algebraically closed field of positive characteristic and let $S$ be a smooth projective connected surface over $k$. We extend the theorem on the Gysin kernel from [20, Theorem 5.1] to also be true over $k$, where…
Let K be an algebraically closed field of prime characteristic p, let N be a positive integer, let f be a self-map on the algebraic torus T=G_m^N defined over K, let V be a curve in T defined over K, and let x be a K-point of T. We show…
We determine which faithful irreducible representations $V$ of a simple linear algebraic group $G$ are generically free for Lie($G$), i.e., which $V$ have an open subset consisting of vectors whose stabilizer in Lie($G$) is zero. This…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
This paper provides a full characterization for when the expansion of a complete o-minimal theory by a unary predicate that picks out a divisible dense and codense subgroup has a model companion. This result is motivated by criteria and…
There is a well studied notion of GIT-stability for coherent systems over curves, which depends on a real parameter $\alpha$. For generated coherent systems, there is a further notion of stability derived from Mumford's definition of linear…