default search action
Grigor Sargsyan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j22]Grigor Sargsyan:
Negative Results on Precipitous ideals on. J. Symb. Log. 88(2): 490-509 (2023) - 2021
- [j21]Grigor Sargsyan:
$AD_{\mathbb {R}}$ implies that all sets of reals are Θ universally Baire. Arch. Math. Log. 60(1-2): 1-15 (2021) - [j20]Grigor Sargsyan, Nam Trang:
Sealing of the Universally Baire Sets. Bull. Symb. Log. 27(3): 254-266 (2021) - [j19]Sandra Müller
, Grigor Sargsyan:
HODHOD\operatorname {HOD} IN INNER MODELS WITH WOODIN CARDINALS. J. Symb. Log. 86(3): 871-896 (2021)
2010 – 2019
- 2019
- [j18]Grigor Sargsyan
An inner model theoretic proof of Becker's theorem. Arch. Math. Log. 58(7-8): 999-1003 (2019) - [j17]Rachid Atmai, Grigor Sargsyan:
Hod up to ADR+Θ is measurable. Ann. Pure Appl. Log. 170(1): 95-108 (2019) - [j16]Dominik Adolf, Grigor Sargsyan:
Derived Models of mice below the least Fixpoint of the Solovay sequence. J. Symb. Log. 84(1): 27-53 (2019) - 2018
- [j15]Grigor Sargsyan, Ralf Schindler:
Varsovian Models I. J. Symb. Log. 83(2): 496-528 (2018) - 2016
- [j14]Grigor Sargsyan, Nam Trang:
Tame failures of the unique branch hypothesis and models of ADℝ + Θ is regular. J. Math. Log. 16(2): 1650007:1-1650007:31 (2016) - 2015
- [j13]Grigor Sargsyan, John Steel:
The mouse Set conjecture for Sets of Reals. J. Symb. Log. 80(2): 671-683 (2015) - 2014
- [j12]Grigor Sargsyan:
Nontame mouse from the failure of square at a singular strong limit cardinal. J. Math. Log. 14(1): 1450003 (2014) - [j11]Grigor Sargsyan:
An Inner Model Proof of the Strong Partition Property for δ21. Notre Dame J. Formal Log. 55(4): 563-568 (2014) - 2013
- [j10]Grigor Sargsyan:
Descriptive inner model theory. Bull. Symb. Log. 19(1): 1-55 (2013) - [j9]Grigor Sargsyan:
On the prewellorderings associated with the directed systems of mice. J. Symb. Log. 78(3): 735-763 (2013) - 2012
- [j8]Arthur W. Apter, Moti Gitik, Grigor Sargsyan:
Indestructible strong compactness but not supercompactness. Ann. Pure Appl. Log. 163(9): 1237-1242 (2012) - 2010
- [j7]Arthur W. Apter, Grigor Sargsyan:
An equiconsistency for universal indestructibility. J. Symb. Log. 75(1): 314-322 (2010)
2000 – 2009
- 2009
- [j6]Grigor Sargsyan:
On the indestructibility aspects of identity crisis. Arch. Math. Log. 48(6): 493-513 (2009) - 2008
- [j5]Arthur W. Apter, Grigor Sargsyan:
Universal indestructibility for degrees of supercompactness and strongly compact cardinals. Arch. Math. Log. 47(2): 133-142 (2008) - [j4]Grigor Sargsyan:
On HOD-supercompactness. Arch. Math. Log. 47(7-8): 765-768 (2008) - 2006
- [j3]Arthur W. Apter, Grigor Sargsyan:
Identity crises and strong compactness III: Woodin cardinals. Arch. Math. Log. 45(3): 307-322 (2006) - 2004
- [j2]Arthur W. Apter, Grigor Sargsyan:
Jonsson-like partition relations and j: V -> V. J. Symb. Log. 69(4): 1267-1281 (2004) - 2003
- [j1]Grigor Sargsyan, S. Tsarukyan:
Visualization of invisible reaction zone of H2 molecules on the front of diffusion flame of propane. J. Vis. 6(1): 8 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: