中文
相关论文

相关论文: On hidden extenders

200 篇论文

Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…

逻辑 · 数学 2018-03-09 Vera Fischer , Daniel T. Soukup

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…

逻辑 · 数学 2012-11-28 Mohammad Assem

Let s(A) denote the number of automorphisms of a model A of power omega_1. We derive a necessary and sufficient condition in terms of trees for the existence of an A with omega_1 < s(A) < 2^{omega_1}. We study the sufficiency of some…

逻辑 · 数学 2016-09-06 Saharon Shelah , Heikki Tuuri , Jouko Väänänen

We introduce a stronger version of an $\omega_1$-guessing model, which we call an indestructibly $\omega_1$-guessing model. The principle IGMP states that there are stationarily many indestructibly $\omega_1$-guessing models. This…

逻辑 · 数学 2019-07-09 Sean Cox , John Krueger

Assuming $\kappa$ is a supercompact cardinal and $\lambda$ is an inaccessible cardinal above it, we present an idea due to Magidor, to find a generic extension in which $\kappa=\aleph_\omega$ and $\lambda=\aleph_{\omega+1}.$

逻辑 · 数学 2017-11-15 Mohammad Golshani

We prove that consistently there is a singular cardinal $\kappa$ of uncountable cofinality such that $2^\kappa$ is weakly inaccessible, and every regular cardinal strictly between $\kappa$ and $2^\kappa$ is the character of some uniform…

逻辑 · 数学 2019-07-30 James Cummings , Charles Morgan

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

逻辑 · 数学 2007-05-23 Saharon Shelah

Given a hypergraph $\Gamma=(\Omega,\mathcal{X})$ and a sequence $\mathbf{p} = (p_\omega)_{\omega\in \Omega}$ of values in $(0,1)$, let $\Omega_{\mathbf{p}}$ be the random subset of $\Omega$ obtained by keeping every vertex $\omega$…

组合数学 · 数学 2019-04-18 Frank Mousset , Andreas Noever , Konstantinos Panagiotou , Wojciech Samotij

We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2^\kappa\…

逻辑 · 数学 2013-06-28 Luca Motto Ros

We investigate a notion called uniqueness in power kappa that is akin to categoricity in power kappa, but is based on the cardinality of the generating sets of models instead of on the cardinality of their universes. The notion is quite…

逻辑 · 数学 2016-09-06 Steven Givant , Saharon Shelah

For a strongly inacessible cardinal $\kappa$, we investigate the relationships between the following ideals: - the ideal of meager sets in the ${<}\kappa$-box product topology - the ideal of "null" sets in the sense of [Sh:1004]…

逻辑 · 数学 2023-05-04 Thomas Baumhauer , Martin Goldstern , Saharon Shelah

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

群论 · 数学 2015-01-23 Mark L. Lewis , James B. Wilson

We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Mikołaj Bojańczyk , Laure Daviaud , Bruno Guillon , Vincent Penelle , A. V. Sreejith

In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…

逻辑 · 数学 2025-11-18 J. B. Nation , Gianluca Paolini

We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown…

逻辑 · 数学 2017-08-01 Ali Enayat , Matt Kaufmann , Zachiri McKenzie

We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…

逻辑 · 数学 2022-04-21 Emil Jeřábek

Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…

逻辑 · 数学 2016-05-03 Jacob Davis

For every uncountable cardinal $\kappa$ there are $2^\kappa$ nonisomorphic simple AF algebras of density character $\kappa$ and $2^\kappa$ nonisomorphic hyperfinite II$_1$ factors of density character $\kappa$. These estimates are maximal…

算子代数 · 数学 2013-01-28 Ilijas Farah , Takeshi Katsura

For a non-empty compact set $E$ in a proper subdomain $\Omega$ of the complex plane, we denote the diameter of $E$ and the distance from $E$ to the boundary of $\Omega$ by $d(E)$ and $d(E,\partial\Omega),$ respectively. The quantity…

复变函数 · 数学 2021-12-07 Oona Rainio , Toshiyuki Sugawa , Matti Vuorinen

We show that a plane continuum X is indecomposable iff X has a sequence (U_n) of not necessarily distinct complementary domains satisfying what we call the double-pass condition: If one draws an open arc A_n in each U_n whose ends limit…

一般拓扑 · 数学 2008-08-12 Clinton P. Curry , John C. Mayer , E. D. Tymchatyn