Grigor Sargsyan

dblp:04/4241 · DBLP profile ↗
← Back
11ranked-venue papers
4as first author
3since 2021 · last 2026
0000-0002-6095-1997ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 4 first-author · 3 since 2021
YearPublicationVenuePosition
2026 UNREACHABILITY OF INDUCTIVE-LIKE POINTCLASSES IN $L(\mathbb {R})$
abstract
Abstract In [3], Hjorth proved from $ZF + AD + DC$ that there is no sequence of distinct $\boldsymbol {\Sigma ^1_2}$ sets of length $\boldsymbol {\delta ^1_2}$ . Sargsyan [11] extends Hjorth’s technique to show there is no sequence of distinct $\boldsymbol {\Sigma ^1_{2n}}$ sets of length $\boldsymbol {\delta ^1_{2n}}$ . Sargsyan conjectured an analogous property is true for any regular Suslin pointclass in $L(\mathbb {R})$ —i.e., if $\kappa $ is a regular Suslin cardinal in $L(\mathbb {R})$ , then there is no sequence of distinct $\kappa $ -Suslin sets of length $\kappa ^+$ in $L(\mathbb {R})$ . We prove this in the case that the pointclass $S(\kappa )$ is inductive-like.
Derek Levinson, Itay Neeman, Grigor Sargsyan
J. Symb. Log.3
2023 Negative Results on Precipitous ideals on
abstract
Abstract We show that in many extender models, e.g., the minimal one with infinitely many Woodin cardinals or the minimal with a Woodin cardinal that is a limit of Woodin cardinals, there are no generic embeddings with critical point $\omega _1$ that resemble the stationary tower at the second Woodin cardinal. The meaning of “resemble” is made precise in the paper (see Definition 0.3).
Grigor Sargsyan
J. Symb. Log.1
2021 HODHOD\operatorname {HOD} IN INNER MODELS WITH WOODIN CARDINALS
abstract
Abstract We analyze the hereditarily ordinal definable sets $\operatorname {HOD} $ in $M_n(x)[g]$ for a Turing cone of reals x, where $M_n(x)$ is the canonical inner model with n Woodin cardinals build over x and g is generic over $M_n(x)$ for the Lévy collapse up to its bottom inaccessible cardinal. We prove that assuming $\boldsymbol \Pi ^1_{n+2}$ -determinacy, for a Turing cone of reals x, $\operatorname {HOD} ^{M_n(x)[g]} = M_n(\mathcal {M}_{\infty } | \kappa _{\infty }, \Lambda ),$ where $\mathcal {M}_{\infty }$ is a direct limit of iterates of $M_{n+1}$ , $\delta _{\infty }$ is the least Woodin cardinal in $\mathcal {M}_{\infty }$ , $\kappa _{\infty }$ is the least inaccessible cardinal in $\mathcal {M}_{\infty }$ above $\delta _{\infty }$ , and $\Lambda $ is a partial iteration strategy for $\mathcal {M}_{\infty }$ . It will also be shown that under the same hypothesis $\operatorname {HOD}^{M_n(x)[g]} $ satisfies $\operatorname {GCH} $ .
Sandra Müller, Grigor Sargsyan
J. Symb. Log.2
2019 Hod up to ADR+Θ is measurable
Rachid Atmai, Grigor Sargsyan
Ann. Pure Appl. Log.2
2019 Derived Models of mice below the least Fixpoint of the Solovay sequence
abstract
Abstract We introduce a mouse whose derived model satisfies $AD_ + {\rm{\Theta }} \ge \theta _{\aleph _2 } $ . More generally, we will introduce a class of large cardinal properties yielding mice whose derived models can satisfy properties as strong as $AD_ + {\rm{\Theta }} = \theta _{\rm{\Theta }} $ .
Dominik Thomas Adolf, Grigor Sargsyan
J. Symb. Log.2
2018 Varsovian Models I
abstract
Abstract Let Msw denote the least iterable inner model with a strong cardinal above a Woodin cardinal. By [11], Msw has a fully iterable core model, ${K^{{M_{{\rm{sw}}}}}}$ , and Msw is thus the least iterable extender model which has an iterable core model with a Woodin cardinal. In V, ${K^{{M_{{\rm{sw}}}}}}$ is an iterate of Msw via its iteration strategy Σ. We here show that Msw has a bedrock which arises from ${K^{{M_{{\rm{sw}}}}}}$ by telling ${K^{{M_{{\rm{sw}}}}}}$ a specific fragment ${\rm{\bar{\Sigma }}}$ of its own iteration strategy, which in turn is a tail of Σ. Hence Msw is a generic extension of $L[{K^{{M_{{\rm{sw}}}}}},{\rm{\bar{\Sigma }}}]$ , but the latter model is not a generic extension of any inner model properly contained in it. These results generalize to models of the form Ms (x) for a cone of reals x, where Ms (x) denotes the least iterable inner model with a strong cardinal containing x. In particular, the least iterable inner model with a strong cardinal above two (or seven, or boundedly many) Woodin cardinals has a 2-small core model K with a Woodin cardinal and its bedrock is again of the form $L[K,{\rm{\bar{\Sigma }}}]$ .
Grigor Sargsyan, Ralf Schindler
J. Symb. Log.1
2015 The mouse Set conjecture for Sets of Reals
abstract
Abstract We show that the Mouse Set Conjecture for sets of reals is true in the minimal model of ADℝ + “Θ is regular”. As a consequence, we get that below ADℝ + “Θ is regular”, models of AD++¬ADℝ are hybrid mice over ℝ. Such a representation of models of AD+ is important in core model induction applications.
Grigor Sargsyan, John Steel
J. Symb. Log.1
2013 On the prewellorderings associated with the directed systems of mice
abstract
Abstract Working under AD, we investigate the length of prewellorderings given by the iterates of ℳ2k+1, which is the minimal proper class mouse with 2k + 1 many Woodin cardinals. In particular, we answer some questions from [4] (the discussion of the questions appears in the last section of [2]).
Grigor Sargsyan
J. Symb. Log.1
2012 Indestructible strong compactness but not supercompactness
Arthur W. Apter, Moti Gitik, Grigor Sargsyan
Ann. Pure Appl. Log.3
2010 An equiconsistency for universal indestructibility
abstract
Abstract We obtain an equiconsistency for a weak form of universal indestructibility for strongness. The equiconsistency is relative to a cardinal weaker in consistency strength than a Woodin cardinal, Stewart Baldwin's notion of hyperstrong cardinal. We also briefly indicate how our methods are applicable to universal indestructibility for supercompactness and strong compactness.
Arthur W. Apter, Grigor Sargsyan
J. Symb. Log.2
2004 Jonsson-like partition relations and j: V -> V
abstract
Abstract. Working in the theory ”ZF + There is a nontrivial elementary embedding j : V → V“, we show that a final segment of cardinals satisfies certain square bracket finite and infinite exponent partition relations. As a corollary to this, we show that this final segment is composed of Jonsson cardinals. We then show how to force and bring this situation down to small alephs. A prototypical result is the construction of a model for ZF in which every cardinal μ ≥ ℵ2 satisfies the square bracket infinite exponent partition relation . We conclude with a discussion of some consistency questions concerning different versions of the axiom asserting the existence of a nontrivial elementary embedding j: V → V. By virtue of Kunen's celebrated inconsistency result, we use only a restricted amount of the Axiom of Choice.
Arthur W. Apter, Grigor Sargsyan
J. Symb. Log.2