default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Foreman 0001
Person information
- affiliation: University of California, Irvine, Department of Mathematics, CA, USA
Other persons with the same name
- Matthew Foreman 0002 — Max Planck Institute for the Science of Light, Erlangen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j17]Matthew Foreman:
Gödel Diffeomorphisms. Bull. Symb. Log. 26(3-4): 219-223 (2020)
2010 – 2019
- 2015
- [j16]Matthew Foreman:
Chang's Conjecture, Generic Elementary Embeddings and Inner Models for Huge Cardinals. Bull. Symb. Log. 21(3): 251-269 (2015) - 2010
- [j15]James Cummings
, Matthew Foreman:
Diagonal Prikry extensions. J. Symb. Log. 75(4): 1383-1402 (2010)
2000 – 2009
- 2009
- [j14]James Cummings, Matthew Foreman, Ernest Schimmerling:
Organic and tight. Ann. Pure Appl. Log. 160(1): 22-32 (2009) - [j13]Matthew Foreman:
Forbidden intervals. J. Symb. Log. 74(4): 1081-1099 (2009) - 2006
- [j12]James Cummings, Matthew Foreman, Menachem Magidor:
Canonical structure in the universe of set theory: part two. Ann. Pure Appl. Log. 142(1-3): 55-75 (2006) - 2005
- [j11]Matthew Foreman, Péter Komjáth:
The Club Guessing Ideal: Commentary on a Theorem of Gitik and Shelah. J. Math. Log. 5(1) (2005) - [j10]Matthew Foreman:
Introduction to the Special Issue on Singular Cardinals Combinatorics. Notre Dame J. Formal Log. 46(3): 249 (2005) - [j9]Matthew Foreman:
Some Problems in Singular Cardinals Combinatorics. Notre Dame J. Formal Log. 46(3): 309-322 (2005) - 2004
- [j8]James Cummings, Matthew Foreman, Menachem Magidor:
Canonical structure in the universe of set theory: part one. Ann. Pure Appl. Log. 129(1-3): 211-243 (2004) - 2003
- [j7]James Cummings, Matthew Foreman, Menachem Magidor:
The non-compactness of square. J. Symb. Log. 68(2): 637-643 (2003) - 2001
- [j6]James Cummings, Matthew Foreman, Menachem Magidor:
Squares, scales and stationary Reflection. J. Math. Log. 1(1) (2001) - [j5]Matthew Foreman, Menachem Magidor, Ralf-Dieter Schindler:
The Consistency Strength of Successive Cardinals with The Tree Property. J. Symb. Log. 66(4): 1837-1847 (2001)
1990 – 1999
- 1999
- [c1]Matthew D. Foreman:
Stationary sets, Chang's conjecture and partition theory. Set Theory: The Hajnal Conference 1999: 73-94 - 1997
- [j4]Matthew Foreman, Menachem Magidor:
A Very Weak Square Principle. J. Symb. Log. 62(1): 175-196 (1997) - 1995
- [j3]Matthew Foreman, Menachem Magidor:
Large Cardinals and Definable Counterexamples to the Continuum Hypothesis. Ann. Pure Appl. Log. 76(1): 47-97 (1995)
1980 – 1989
- 1986
- [j2]Matthew Foreman, Menachem Magidor, Saharon Shelah:
0 # and Some Forcing Principles. J. Symb. Log. 51(1): 39-46 (1986) - 1983
- [j1]Matthew Foreman:
Games Played on Boolean Algebras. J. Symb. Log. 48(3): 714-723 (1983)
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:48 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:
