ID: math/9205202

Critical points in an algebra of elementary embeddings

May 7, 1992

View on ArXiv

Similar papers 5

On the Woodin Construction of Failure of GCH at a Measurable Cardinal

June 25, 2017

76% Match
Yoav Ben Shalom
Logic

Let GCH hold and let $j:V\longrightarrow M$ be a definable elementary embedding such that $crit(j)=\kappa$, $^{\kappa}M\subseteq M$ and $\kappa^{++}=\kappa_{M}^{++}$. H. Woodin proved that there is a cofinality preserving generic extension in which $\kappa$ is measurable and GCH fails at it. This is done by using an Easton support iteration of Cohen forcings for blowing the power of every inaccessible $\alpha\leq\kappa$ to $\alpha^{++}$, and then adding another forcing on top...

Find SimilarView on arXiv

Ramsey-like cardinals

January 30, 2008

76% Match
Victoria Gitman
Logic

One of the numerous characterizations of a Ramsey cardinal kappa involves the existence of certain types of elementary embeddings for transitive sets of size \kappa satisfying a large fragment of ZFC. We introduce new large cardinal axioms generalizing the Ramsey elementary embeddings characterization and show that they form a natural hierarchy between weakly compact cardinals and measurable cardinals. These new axioms serve to further our knowledge about the elementary embed...

Find SimilarView on arXiv

The uniqueness of elementary embeddings

March 25, 2021

76% Match
Gabriel Goldberg
Logic

Much of the theory of large cardinals beyond a measurable cardinal concerns the structure of elementary embeddings of the universe of sets into inner models. This paper seeks to answer the question of whether the inner model uniquely determines the elementary embedding.

Find SimilarView on arXiv

On ideals related to Laver and Miller trees

December 3, 2023

76% Match
Aleksander Cieślak, Arturo Martínez-Celis
Logic

In this work we consider the ideals $m^0(\mathcal{I})$ and $\ell^0(\mathcal{I})$, ideals generated by the $\mathcal{I}$-positive Miller trees and $\mathcal{I}$-positive Laver trees, respectively. We investigate in which cases these ideals have cofinality larger than $\mathfrak{c}$ and we calculate some cardinal invariants closely related to these ideals.

Find SimilarView on arXiv

Large transitive models in local {\rm ZFC}

March 27, 2023

76% Match
Athanassios Tzouvaras
Logic

This paper is a sequel to \cite{Tz10}, where a local version of ZFC, LZFC, was introduced and examined and transitive models of ZFC with properties that resemble large cardinal properties, namely Mahlo and $\Pi_1^1$-indescribable models, were considered. By analogy we refer to such models as "large models", and the properties in question as "large model properties". Continuing here in the same spirit we consider further large model properties, that resemble stronger large car...

Find SimilarView on arXiv

PCF and infinite free subsets

July 15, 1998

76% Match
Saharon Shelah
Logic

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show that large pcf(a) implies existence of free sets. An example is that if pp(aleph_omega)> aleph_{omega_1} then for every algebra M of cardinality aleph_omega with countably many functions, for some a_n in M (for n< omega) we have a_n notin cl...

Find SimilarView on arXiv

Sommets fortement critiques d'un tournoi ind\'ecomposable

October 25, 2023

76% Match
Sahbani Rachid
Combinatorics

Let $T=(V,A)$ be a tournament. For $X\subseteq V$, the subtournament of $T$ induced by $X$ is denoted by $T[X]$. A subset $I$ of $V$ is an interval of $T$ provided that for every $a,b\in I$ and $x\in V\setminus I$, $(a,x)\in A$ if and only if $(b,x)\in A$. For example, $\varnothing $, ${x}$ ($x \in V$) and $V$ are intervals of $T$, called trivial intervals. The tournament $T$ is indecomposable if all its intervals are trivial, otherwise, it is decomposable. A critical tournam...

Find SimilarView on arXiv

On colimits and elementary embeddings

February 23, 2012

76% Match
Joan Bagaria, Andrew Brooke-Taylor
Logic
Category Theory

We give a sharper version of a theorem of Rosicky, Trnkova and Adamek, and a new proof of a theorem of Rosicky, both about colimit preservation between categories of structures. Unlike the original proofs, which use category-theoretic methods, we use set-theoretic arguments involving elementary embeddings given by large cardinals such as alpha-strongly compact and C^(n)-extendible cardinals.

Find SimilarView on arXiv

ZFC without power set II: Reflection strikes back

June 13, 2022

75% Match
Victoria Gitman, Richard Matthews
Logic

The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC without power set) with largest cardinal $\omega$ in which this principle fails for $\omega$ many choices. In this article we study failures of dependent choice principles over ZFC$^-$ by considering the notion of big proper classes. A prope...

Find SimilarView on arXiv

The Joint Embedding Property and Maximal Models

January 29, 2015

75% Match
John T. Baldwin, Martin Koerwien, Ioannis Souldatos
Logic

We introduce the notion of a `pure` Abstract Elementary Class to block trivial counterexamples. We study classes of models of bipartite graphs and show: Main Theorem (cf. Theorem 3.5.2 and Corollary 3.5.6): If $(\lambda_i : i \le \alpha<\aleph_1)$ is a strictly increasing sequence of characterizable cardinals (Definition 2.1) whose models satisfy JEP$(<\lambda_0)$, there is an $L_{\omega_1,\omega}$ -sentence $\psi$ whose models form a pure AEC and (1) The models of $\psi$...

Find SimilarView on arXiv