default search action
Heike Mildenberger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Heike Mildenberger:
Exactly two and exactly three near-coherence classes. J. Math. Log. 24(1): 2350003:1-2350003:41 (2024) - 2023
- [j29]Giorgio Laguzzi, Heike Mildenberger, Brendan Stuber-Rousselle:
Mathias and silver forcing parametrized by density. Arch. Math. Log. 62(7-8): 965-990 (2023) - [j28]Giorgio Laguzzi, Heike Mildenberger, Brendan Stuber-Rousselle
:
On splitting trees. Math. Log. Q. 69(1): 15-30 (2023) - 2021
- [j27]Heike Mildenberger, Saharon Shelah
Higher Miller forcing May collapse Cardinals. J. Symb. Log. 86(4): 1721-1744 (2021) - 2020
- [j26]Heike Mildenberger, Saharon Shelah:
A version of κ-Miller forcing. Arch. Math. Log. 59(7-8): 879-892 (2020) - [j25]Filippo Calderoni
Uncountable structures are not classifiable up to bi-embeddability. J. Math. Log. 20(1): 2050001 (2020)
2010 – 2019
- 2019
- [j24]Heike Mildenberger, Saharon Shelah
Specializing Aronszajn Trees with Strong Axiom A and Halving. Notre Dame J. Formal Log. 60(4): 587-616 (2019) - 2014
- [j23]Heike Mildenberger, Saharon Shelah
Many countable support iterations of proper forcings preserve Souslin trees. Ann. Pure Appl. Log. 165(2): 573-608 (2014) - 2011
- [j22]Heike Mildenberger:
The club principle and the distributivity number. J. Symb. Log. 76(1): 34-46 (2011) - [j21]Heike Mildenberger, Saharon Shelah
The minimal cofinality of an ultrapower of ω and the cofinality of the symmetric groupcan be larger than +. J. Symb. Log. 76(4): 1322-1340 (2011) - [j20]Heike Mildenberger:
On Milliken-Taylor Ultrafilters. Notre Dame J. Formal Log. 52(4): 381-394 (2011) - 2010
- [j19]Heike Mildenberger:
Finding generic filters by playing games. Arch. Math. Log. 49(1): 91-118 (2010)
2000 – 2009
- 2009
- [j18]Heike Mildenberger:
Creatures on omega1 and weak diamonds. J. Symb. Log. 74(1): 1-16 (2009) - 2007
- [j17]Heike Mildenberger, Saharon Shelah
Increasing the groupwise density number by c.c.c. forcing. Ann. Pure Appl. Log. 149(1-3): 7-13 (2007) - [j16]Heike Mildenberger:
There may be infinitely many near-coherence classes under 픲 < 픡. J. Symb. Log. 72(4): 1228-1238 (2007) - 2006
- [j15]Heike Mildenberger, Saharon Shelah
Covering the Baire space by families which are not finitely dominating. Ann. Pure Appl. Log. 140(1-3): 60-71 (2006) - 2004
- [j14]Heike Mildenberger:
More canonical forms and dense free subsets. Ann. Pure Appl. Log. 125(1-3): 75-99 (2004) - 2003
- [j13]Heike Mildenberger, Saharon Shelah
Specialising Aronszajn trees by countable approximations. Arch. Math. Log. 42(7): 627-647 (2003) - 2002
- [j12]Heike Mildenberger, Saharon Shelah
The Relative Consistency of g < cf (Sym(omega)). J. Symb. Log. 67(1): 297-314 (2002) - [j11]Heike Mildenberger:
No Borel Connections for the Unsplitting Relations. Math. Log. Q. 48(4): 517-521 (2002) - 2001
- [j10]Heike Mildenberger:
Groupwise dense families. Arch. Math. Log. 40(2): 93-112 (2001) - [j9]Heike Mildenberger:
The Strengths of Some Violations of Covering. Math. Log. Q. 47(3): 291-298 (2001) - 2000
- [j8]Heike Mildenberger, Saharon Shelah
Changing cardinal characteristics without changing Omega-sequences or cofinalities. Ann. Pure Appl. Log. 106(1-3): 207-260 (2000)
1990 – 1999
- 1999
- [j7]Andreas Blass, Heike Mildenberger:
On The Confinality of Ultrapowers. J. Symb. Log. 64(2): 727-736 (1999) - [j6]Heike Mildenberger:
Borel on the Questions Versus Borel on the Answers. Math. Log. Q. 45: 127-133 (1999) - 1998
- [j5]Heike Mildenberger, Otmar Spinas:
Meeting infinitely many cells of a partition once. Arch. Math. Log. 37(7): 495-503 (1998) - [j4]Heike Mildenberger:
Changing Cardinal Invariants of the Reals without Changing Cardinals or the Reals. J. Symb. Log. 63(2): 593-599 (1998) - 1997
- [j3]Heike Mildenberger:
Order Types of Free Subsets. Ann. Pure Appl. Log. 89(1): 75-83 (1997) - [j2]Heike Mildenberger:
Non-Constructive Galois-Tukey Connections. J. Symb. Log. 62(4): 1179-1186 (1997) - 1992
- [j1]Heike Mildenberger:
On the homogeneity property for certain quantifier logics. Arch. Math. Log. 31(6): 445-455 (1992)
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:47 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: