arXiv 1506.034332015-06math.LO

Automorphisms of $\mathscr{P}(λ)/\mathscr{I}_κ$

Paul Larson, Paul McKenney

备注：: 23 pages

英文摘要：

We study conditions on automorphisms of Boolean algebras of the form $P(λ)/I_κ$ (where $λ$ is an uncountable cardinal and $I_κ$ is the ideal of sets of cardinality less than $κ$) which allow one to conclude that a given automorphism is trivial. We show (among other things) that every cardinality-preserving automorphism of $P(2^κ)/I_{κ^+}$ which is trivial on all sets of cardinality $κ^+$ is trivial, and that $MA_{\aleph_1}$ implies that every automorphism of $P(\mathbb{R})/Fin$ is trivial on a cocountable set.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

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 th…

2013-01-18math.LO

Generic Vopěnka cardinals and models of ZF with few $\aleph_1$-Suslin sets

We define a generic Vopěnka cardinal to be an inaccessible cardinal $κ$ such that for every first-order language $\mathcal{L}$ of cardinality less than $κ$ and every set $\mathscr{B}$ of $\mathcal{L}$-structures, if $|\mathscr{B}| = κ$ and every structure in $\mathscr{B}$ has cardinality less than $κ$, then an elementary embedding between two structures in $\mathscr{B}$ exists in some generic extension of $V$. We investigate connections between generic Vopěnka cardinals in models of ZFC and the number and complexity of $\aleph_1$-Suslin sets of reals in models of ZF. In particular, we show tha…

2018-07-06math.LO

极限群与κ-存在闭群的自同构

Limit Groups and Automorphisms of $κ$-Existentially Closed Groups

本文研究κ-存在闭群的自同构群基数问题，证明了基数为κ的κ-存在闭群的自同构群基数为2^κ，并回答了Kegel关于任意不可数基数κ上存在泛群的问题。

2024-08-31math.GRmath.LO

The automorphism group of a saturated model has a large dense free subgroup

We prove that for a stable theory $T,$ if $M$ is a saturated model of $T$ of cardinality $λ$ where $λ> \big|T\big|,$ then $Aut(M)$ has a dense free subgroup on $2^λ$ generators. This affirms a conjecture of Hodges.

1993-04-12math.LO

带函数的 Cohen 泛型结构

Cohen Generic Structures with Functions

本文研究了带函数语言的 Cohen 泛型结构，证明了在一般条件下其偏序满足链条件，并给出了泛型满足 Fraïssé 极限理论、具有刚性或大自同构群的条件。

2024-06-05math.LO

长度为 $\kappa^+$ 的自同构塔

An automorphism tower of length $κ^+$

Technion - Israel Institute of Technology（以色列理工学院）；Hebrew University of Jerusalem（耶路撒冷希伯来大学）

本文构造了一个基数为 $\kappa$ 的无中心群，其自同构塔恰好在 $\kappa^+$ 步终止，解决了 Simon Thomas 提出的问题。

2026-09-14math.GRmath.LO

更多相关论文收起更多论文

Superatomic Boolean Algebras: maximal rigidity

We prove that for any superatomic Boolean Algebra of cardinality >beth_omega there is an automorphism moving uncountably many atoms. Similarly for larger cardinals. Any of those results are essentially best possible.

2000-09-07math.LO

The height of the automorphism tower of a group

For a group G with trivial center there is a natural embedding of G into its automorphism group, so we can look at the latter as an extension of the group. So an increasing continuous sequence of groups, the automorphism tower, is defined, the height is the ordinal where this becomes fixed, arriving to a complete group. We first show that for any kappa=kappa^{aleph_0} there is a group of cardinality kappa with height>kappa^+ (improving the lower bound). Second we show that for many such kappa there is a group of height > 2^kappa, so proving that the upper bound essentially cannot be improved.

2005-11-13math.GRmath.LO

On compactness of logics that can express properties of symmetry or connectivity

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to prove that for a number of natural properties P speaking about automorphism groups or connectivity, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. We also give an example of a logic that extends first-order logic, has the compactness property and can express the property "the cardinality of…

2013-04-12math.LO

Compactness of the quantifier on "Complete Embedding of BA's"

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not use Skolem function (which do not matter for proving compactness of logics but still are of interest). Let lambda be 2^mu if regular and its successor otherwise. Model theoretically we investigate notions of bigness of types, usually those are ideals of the set of formulas in a model, definable in appropriate sense. We build a model of cardinality lambda^plus …

2016-01-14math.LO