default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictoria Gitman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Sy-David Friedman, Victoria Gitman, Sandra Müller:
Structural Properties of the stable Core. J. Symb. Log. 88(3): 889-918 (2023)- 2022
- [j18]Victoria Gitman, Thomas A. Johnstone:
Indestructibility properties of Ramsey and Ramsey-like cardinals. Ann. Pure Appl. Log. 173(6): 103106 (2022) - 2021
- [j17]Brent Cody
, Victoria Gitman, Chris Lambie-Hanson:
Forcing a □(κ)-like principle to hold at a weakly compact cardinal. Ann. Pure Appl. Log. 172(7): 102960 (2021) - 2020
- [j16]Victoria Gitman, Joel David Hamkins, Peter Holy, Philipp Schlicht, Kameryn J. Williams:
The exact strength of the class forcing Theorem. J. Symb. Log. 85(3): 869-905 (2020)
2010 – 2019
- 2019
- [j15]Victoria Gitman, Joel David Hamkins:
A model of the generic Vopěnka principle in which the ordinals are not Mahlo. Arch. Math. Log. 58(1-2): 245-265 (2019) - [j14]Sy-David Friedman, Victoria Gitman, Vladimir Kanovei:
A model of second-order arithmetic satisfying AC but not DC. J. Math. Log. 19(1): 1850013:1-1850013:39 (2019) - 2018
- [j13]Victoria Gitman, Ralf Schindler:
Virtual large cardinals. Ann. Pure Appl. Log. 169(12): 1317-1334 (2018) - [j12]Gunter Fuchs, Victoria Gitman, Joel David Hamkins:
Ehrenfeucht's Lemma in Set Theory. Notre Dame J. Formal Log. 59(3): 355-370 (2018) - 2017
- [j11]Joan Bagaria, Victoria Gitman, Ralf Schindler:
Generic Vopěnka's Principle, remarkable cardinals, and the weak Proper Forcing Axiom. Arch. Math. Log. 56(1-2): 1-20 (2017) - [j10]Gunter Fuchs, Victoria Gitman, Joel David Hamkins:
Incomparable ω1-like models of set theory. Math. Log. Q. 63(1-2): 66-76 (2017) - 2016
- [j9]Victoria Gitman, Joel David Hamkins, Thomas A. Johnstone:
What is the theory without power set? Math. Log. Q. 62(4-5): 391-406 (2016) - 2015
- [j8]Yong Cheng, Victoria Gitman:
Indestructibility properties of remarkable cardinals. Arch. Math. Log. 54(7-8): 961-984 (2015) - [j7]Brent Cody, Victoria Gitman:
Easton's theorem for Ramsey and strongly Ramsey cardinals. Ann. Pure Appl. Log. 166(9): 934-952 (2015) - 2012
- [j6]Arthur W. Apter, Victoria Gitman, Joel David Hamkins:
Inner models with large cardinal features usually obtained by forcing. Arch. Math. Log. 51(3-4): 257-283 (2012) - 2011
- [j5]Victoria Gitman:
Ramsey-like cardinals. J. Symb. Log. 76(2): 519-540 (2011) - [j4]Victoria Gitman, Philip D. Welch:
Ramsey-like cardinals II. J. Symb. Log. 76(2): 541-560 (2011) - 2010
- [j3]Victoria Gitman, Joel David Hamkins:
A Natural Model of the Multiverse Axioms. Notre Dame J. Formal Log. 51(4): 475-484 (2010)
2000 – 2009
- 2009
- [j2]Victoria Gitman:
Proper and piecewise proper families of reals. Math. Log. Q. 55(5): 542-550 (2009) - 2008
- [j1]Victoria Gitman:
Scott's problem for Proper Scott sets. J. Symb. Log. 73(3): 845-860 (2008)
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-08-05 20:15 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:
