arXiv subjects
Publications and source records attributed to Itay Kaplan.
We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $θ$ there is a dependent theory $T$ of size $θ$ such that for all $κ$ and $δ$, $κ\to\left(δ\right)_{T,1}$ iff $κ\to\left(δ\right)_θ^{<ω}$. This means that unless there are good set theoretical reasons, there are large sets with no indiscernible sequences.
We prove that in NTP_2 theories if p is a dependent type with dp-rank >= κ, then this can be witnessed by indiscernible sequences of tuples satisfying p. If p has dp-rank infinity, then this can be witnessed by singletons (in any theory).
We provide a new criterion for embedding $\mathbb{E}_{0}$, and apply it to equivalence relations in model theory. This generalize the results of the authors and Pierre Simon on the Borel cardinality of Lascar strong types equality, and Newelski's results about pseudo $F_σ$ groups.
NTP2 is a large class of first-order theories defined by Shelah and generalizing simple and NIP theories. Algebraic examples of NTP2 structures are given by ultra-products of p-adics and certain valued difference fields (such as a non-standard Frobenius automorphism living on an algebraically closed valued field of characteristic 0). In this note we present some results on groups and fields definable in NTP2 structures. Most importantly, we isolate a chain condition for definable normal subgroups and use it to show that any NTP2 field has only finitely many Artin-Schreier extensions. We also discuss a stronger chain condition coming from imposing bounds on burden of the theory (an appropriate analogue of weight), and show that every strongly dependent valued field is Kaplansky.
We show that if the restriction of the Lascar equivalence relation to a KP-strong type is non-trivial, then it is non-smooth (when viewed as a Borel equivalence relation on an appropriate space of types).
In this note we prove and disprove some chain conditions in type definable and definable groups in dependent, strongly dependent and strongly^{2} dependent theories.
The main result of this article is sub-additivity of the dp-rank. We also show that the study of theories of finite dp-rank can not be reduced to the study of its dp-minimal types, and discuss the possible relations between dp-rank and VC-density.
This paper can be viewed as a continuation of [KS09] that dealt with the automorphism tower problem without Choice. Here we deal with the inequation which connects the automorphism tower and the normalizer tower without Choice and introduce a new proof to a theorem of Fried and Kollár that any group can be represented as an automorphism group of a field. The proof uses a simple construction: working more in graph theory, and less in algebra.
In this note we interpret Voevodsky's Univalence Axiom in the language of (abstract) model categories. We then show that any posetal locally Cartesian closed model category $Qt$ in which the mapping $Hom^{(w)}(Z\times B,C):Qt\longrightarrow Sets$ is functorial in $Z$ and represented in $Qt$ satisfies our homotopy version of the Univalence Axiom, albeit in a rather trivial way. This work was motivated by a question reported in [Ob], asking for a model of the Univalence Axiom not equivalent to the standard one.
We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that dependence is equivalent to bounded non-forking assuming NTP_2.
We show that NIP fields have no Artin-Schreier extension, and that simple fields have only a finite number of them.
For a centerless group G, we can define its automorphism tower. We define G^{alpha} : G^0=G, G^{alpha +1}=Aut(G^alpha) and for limit ordinals G^delta=bigcup_{alpha < delta}G^alpha . Let tau_G be the ordinal when the sequence stabilizes. Thomas' celebrated theorem says tau_G<2^{|G|})^{+} and more. If we consider Thomas' proof too set theoretical, we have here a shorter proof with little set theory. However, set theoretically we get a parallel theorem without the axiom of choice. We attach to every element in G^alpha, the alpha-th member of the automorphism tower of G, a unique quantifier free type over G (whish is a set of words from G*< x>). This situation is generalized by defining ``(G,A) is a special pair''.