Searcharxiv⌕ Search

arXiv subjects

Saharon Shelah

Publications and source records attributed to Saharon Shelah.

At least 307 records · Page 17Linked to original sources
arXiv2013

Free groups and automorphism groups of infinite fields

Let λbe a cardinal with λ=λ^{\aleph_0} and p be either 0 or a prime number. We show that there are fields K_0 and K_1 of cardinality λand characteristic p such that the automorphism group of K_0 is a free group of cardinality 2^λand the automorphism group of K_1 is a free abelian group of cardinality 2^λ. This partially answers a question from [8] and complements results from [15], [16] and [17]. The methods developed in the proof of the above statement also allow us to show that the above cardinal arithmetic assumption is consistently not necessary for the existence of such fields and that the existence of a cardinal λof uncountable cofinality with the property that there is no field of cardinality λwhose automorphism group is a free group of cardinality greater than λimplies the existence of large cardinals in certain inner models of set theory.

math.LO↗
arXiv2012

Partition Calculus and Cardinal Invariants

We prove that the strong polarized relation of $θ$ above $ω$ applied simultaneously for every cardinal in the interval $[\aleph_1,\aleph]$ is consistent. We conclude that this positive relation is consistent for every cardinal invariant on the continuum. We show that similar results hold for a supercompact cardinal, and for a strong limit singular under some assumptions.

math.LO↗
arXiv2012

Trivial automorphisms

We prove that the statement `For all Borel ideals I and J on $ω$, every isomorphism between Boolean algebras $P(ω)/I$ and $P(ω)/J$ has a continuous representation' is relatively consistent with ZFC. In this model every isomorphism between $P(ω)/I$ and any other quotient $P(ω)/J$ over a Borel ideal is trivial for a number of Borel ideals I on $ω$. We can also assure that the dominating number is equal to $\aleph_1$ and that $2^{\aleph_1}>2^{\aleph_0}$. Therefore the Calkin algebra has outer automorphisms while all automorphisms of $P(ω)/Fin$ are trivial. Proofs rely on delicate analysis of names for reals in a countable support iteration of suslin proper forcings.

math.LO↗
arXiv2012

More about lambda-support iterations of <lambda-complete forcing notions

This article continues Rosłanowski and Shelah math.LO/9906024, math.LO/0508272, math.LO/0210205, math.LO/0611131 and math.LO/0605067. We introduce here a new property of <lambda-strategically complete forcing notions which implies that their lambda-support iterations do not collapse lambda^+ (for a strongly inaccessible cardinal lambda).

math.LO↗
arXiv2012

Independent families in Boolean algebras with some separation properties

We prove that any Boolean algebra with the subsequential completeness property contains an independent family of size continuum. This improves a result of Argyros from the 80ties which asserted the existence of an uncountable independent family. In fact we prove it for a bigger class of Boolean algebras satisfying much weaker properties. It follows that the Stone spaces of all such Boolean algebras contains a copy of the Cech-Stone compactification of the integers and the Banach space of contnuous functions on them has $l_\infty$ as a quotient. Connections with the Grothendieck property in Banach spaces are discussed.

math.LO↗
arXiv2012

On incompactness for chromatic number of graphs

We deal with incompactness. Assume the existence of non-reflecting stationary set of cofinality kappa . We prove that one can define a graph G whose chromatic number is > kappa, while the chromatic number of every subgraph G' subseteq G,|G'| < |G| is <= kappa . The main case is kappa = aleph_0.

math.LO↗
arXiv2012

Model Theory

An essay on Model Theory: Why am I interested in model theory? What are, in my opinion, the most challenging problems in model theory?

math.LO↗
arXiv2012

Perpendicular Indiscernible Sequences in Real Closed Fields

We investigate the behaviour of concepts from dependent theories when applied to real closed fields. Our main focus is on the concept of perpendicular indiscernible sequences, a concept first introduced in section 4 of math.LO/0009056 . This is essentially the MSc. thesis of the first author written under he guidance of the second author.

math.LO↗
arXiv2012

Pseudo PCF

We continue our investigation on pcf with weak form of choice. Characteristically we assume DC + P(Y) when looking and prod_{s in Y} delta_s. We get more parallel of theorems on pcf.

math.LO↗
arXiv2012

Non-reflection of the bad set for {check I}_theta[lambda] and pcf

We reconsider here the following related pcf questions and make some advances: (Q1) concerning the ideal {check I}_kappa [lambda] how much reflection do we have for the bad set S^{bd}_{lambda, kappa} subseteq {delta < lambda : cf(delta)= kappa} assuming it is well defined? (Q2) for an ideal J on kappa how large are S^{bd}_J[f],S^{ch}_J[f] for f=< f_alpha : alpha which is <_J-increasing and cofinal in (prod limits_{i< kappa} lambda_i,<_J) ? (Q3) are there somewhat free black boxes?

math.LO↗
arXiv2012

Models of PA: when two elements are necessarily order automorphic

We hope to see how much for a model M of some completion T of PA (Peano Arithmetic) does M restriction {<} determine M, say up to isomorphism. We advance in characterizing for non-standard models M of PA the "minimal" set {(a,b):n < a < b for n in N and the linear orders {c:c <_M a}, {c:c <_M b} are isomorphic}, in particular include {(a,b): for no c in M for every n in N we have M models (forall n in N)(exists c)[2 < c^n < a wedge b < a c^n]} and for some model is equal to {(a,b):a < b < a^n for some n in N}.

math.LO↗
arXiv2012

A strong polarized relation

We prove the consistency of a strong polarized relation for a cardinal and its successor, using pcf and forcing

math.LO↗
arXiv2012

Dependent dreams: recounting types

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent theories. Another way to say this is: we have to look at small enough neighborhood and use reasonably definable types to analyze a type. We note the results understable without reading. First, a parallel to the "stability spectrum", the "recounting of types", that is assume lambda = lambda^{< lambda} is large enough, M a saturated model of T of cardinality lambda, let bold S_{aut}(M) be the number of complete types over M up to being conjugate, i.e. we identify p,q when some automorphism of M maps p to q . Whereas for independent T the number is 2^lambda, for dependent T the number is <= lambda moreover it is <= | alpha |^{|T|} when lambda = aleph_alpha. Second, for stable theories "lots of indiscernibility exists" a "too good indiscernible existence theorem" saying, e.g. that if the type tp (d_beta ; {d_beta : beta < alpha}) is increasing for alpha < kappa = cf(kappa) and kappa > 2^{|T|} then is indiscernible for some stationary S subseteq kappa. Third, for stable T,a model is kappa-saturated iff it is aleph_epsilon-saturated and every infinite indiscernible set (of elements) of cardinality < kappa can be increased. We prove here an analog. Fourth, for p in S(M), the number of ultrafilters on the outside definable subsets of M extending p has an absolute bound 2^{|T|} . Restricting ourselves to one phi(x, y), the number is finite, with an absolute found (well depending on T and phi).

math.LO↗
arXiv2012

Chain conditions in dependent groups

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.

math.LO↗
arXiv2011

Partial choice functions for families of finite sets

Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element sets has a choice function. In the case where m=p is prime, to obtain the independence result we make use of a permutation model in which the set of atoms has the structure of a vector space over the field of p elements. When m is non-prime, a suitable permutation model is built from the models used in the prime cases.

math.LO↗