Jörg Brendle
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jörg Brendle has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Wolfgang Wohofsky
Institute of Mathematics, University of Vienna, Vienna, Austria
5 shared publications - Yurii Khomskii
Kurt Gödel Research Center for Mathematical Logic (KGRC), University of Vienna, Vienna, Austria
5 shared publications - Diego Alejandro Mejía
Graduate School of System Informatics, Kobe University
4 shared publications - Joel David Hamkins
University of Notre Dame
4 shared publications - Will Brian
University of North Carolina at Charlotte
4 shared publications - Andrew D. Brooke-Taylor
Kobe University
3 shared publications
Latest Publications
- Open Access
- 3 December 2025
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- p. 1-69
Combinatorial properties of MAD families
We study some strong combinatorial properties of MAD families. An ideal $\mathcal {I}$ is Shelah–Steprāns if for every set $X\subseteq \left [ \omega \right ] ^{<\omega }$ , there is an element of $\mathcal {I}$ that either intersects every set in X or contains infinitely many members of it. We prove that a Borel ideal is Shelah–Steprāns if and only if it is Katětov above the ideal fin $\times $ fin , and that Shelah–Steprāns MAD families have strong indestructibility properties (in particular, they are both Cohen and random indestructible). We also consider some other strong combinatorial properties of MAD families. It is proved that it is consistent to have $\operatorname {\mathrm {non}}(\mathcal {M}) = {\aleph }_{1}$ and no Shelah–Steprāns families of size ${\aleph }_{1}$ . We develop a general machinery for producing models of set theory with $\operatorname {\mathrm {non}}(\mathcal {M}) = {\aleph }_{1}$ in order to prove this result.- 3 December 2025
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- p. 1-69
Open AccessCombinatorial properties of MAD families
We study some strong combinatorial properties of MAD families. An ideal $\mathcal {I}$ is Shelah–Steprāns if for every set $X\subseteq \left [ \omega \right ] ^{<\omega }$ , there is an element of $\mathcal {I}$ that either intersects every set in X or contains infinitely many members of it. We prove that a Borel ideal is Shelah–Steprāns if and only if it is Katětov above the ideal fin $\times $ fin , and that Shelah–Steprāns MAD families have strong indestructibility properties (in particular, they are both Cohen and random indestructible). We also consider some other strong combinatorial properties of MAD families. It is proved that it is consistent to have $\operatorname {\mathrm {non}}(\mathcal {M}) = {\aleph }_{1}$ and no Shelah–Steprāns families of size ${\aleph }_{1}$ . We develop a general machinery for producing models of set theory with $\operatorname {\mathrm {non}}(\mathcal {M}) = {\aleph }_{1}$ in order to prove this result. - Top Cited Papers
- 3 July 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
Separating cardinal characteristics of the strong measure zero ideal
Let [ ] be the [ ]-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of [ ] after finite support iterations. This is applied to force that the four cardinal characteristics associated with [ ] are pairwise different: [ ] Furthermore, we construct a forcing extension satisfying the above and Cichoń’s maximum (i.e. that the non-dependent values in Cichoń’s diagram are pairwise different).
- 3 July 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
Top Cited PapersSeparating cardinal characteristics of the strong measure zero ideal
Let [ ] be the [ ]-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of [ ] after finite support iterations. This is applied to force that the four cardinal characteristics associated with [ ] are pairwise different: [ ] Furthermore, we construct a forcing extension satisfying the above and Cichoń’s maximum (i.e. that the non-dependent values in Cichoń’s diagram are pairwise different).
- Open Access
Density cardinals
How many permutations are needed so that every infinite-coinfinite set of natural numbers with asymptotic density can be rearranged to no longer have the same density? We prove that the density number $\mathfrak{dd}$, which answers this question, is equal to the least size of a non-meager set of reals, $\mathsf{non} (\mathcal{M})$. The same argument shows that a slight modification of the rearrangement number $\mathfrak{rr}$ of~\cite{BBBHHL20} is equal to $\mathsf{non} (\mathcal{M})$, and similarly for a cardinal invariant related to large-scale topology introduced by Banakh~\cite{Ba23}, thus answering a question of the latter. We then consider variants of $\mathfrak{dd}$ given by restricting the possible densities of the original set and / or of the permuted set, providing lower and upper bounds for these cardinals and proving consistency of strict inequalities. We finally look at cardinals defined in terms of relative density and of asymptotic mean, and relate them to the rearrangement numbers of~\cite{BBBHHL20}.Open AccessDensity cardinals
How many permutations are needed so that every infinite-coinfinite set of natural numbers with asymptotic density can be rearranged to no longer have the same density? We prove that the density number $\mathfrak{dd}$, which answers this question, is equal to the least size of a non-meager set of reals, $\mathsf{non} (\mathcal{M})$. The same argument shows that a slight modification of the rearrangement number $\mathfrak{rr}$ of~\cite{BBBHHL20} is equal to $\mathsf{non} (\mathcal{M})$, and similarly for a cardinal invariant related to large-scale topology introduced by Banakh~\cite{Ba23}, thus answering a question of the latter. We then consider variants of $\mathfrak{dd}$ given by restricting the possible densities of the original set and / or of the permuted set, providing lower and upper bounds for these cardinals and proving consistency of strict inequalities. We finally look at cardinals defined in terms of relative density and of asymptotic mean, and relate them to the rearrangement numbers of~\cite{BBBHHL20}. - 2 October 2024
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 152 (12) , 5395-5410
Borel conjecture for the Marczewski ideal
We show in ZFC that there is no set of reals of size continuum which can be translated away from every set in the Marczewski ideal. We also show that in the Cohen model, every set with this property is countable.
- 2 October 2024
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 152 (12) , 5395-5410
Borel conjecture for the Marczewski ideal
We show in ZFC that there is no set of reals of size continuum which can be translated away from every set in the Marczewski ideal. We also show that in the Cohen model, every set with this property is countable.
- Open Access
Borel Conjecture for the Marczewski ideal
We show in ZFC that there is no set of reals of size continuum which can be translated away from every set in the Marczewski ideal. We also show that in the Cohen model, every set with this property is countable.
Open AccessBorel Conjecture for the Marczewski ideal
We show in ZFC that there is no set of reals of size continuum which can be translated away from every set in the Marczewski ideal. We also show that in the Cohen model, every set with this property is countable.
- Open Access
Halfway New Cardinal Characteristics
Based on the well-known cardinal characteristics $\mathfrak{s}$, $\mathfrak{r}$ and $\mathfrak{i}$, we introduce nine related cardinal characteristics by using the notion of asymptotic density to characterise different intersection properties of infinite sets. We prove several bounds and consistency results, e. g. the consistency of $\mathfrak{s} < \mathfrak{s}_{1/2}$, as well as several results about possible values of $\mathfrak{i}_{1/2}$.Open AccessHalfway New Cardinal Characteristics
Based on the well-known cardinal characteristics $\mathfrak{s}$, $\mathfrak{r}$ and $\mathfrak{i}$, we introduce nine related cardinal characteristics by using the notion of asymptotic density to characterise different intersection properties of infinite sets. We prove several bounds and consistency results, e. g. the consistency of $\mathfrak{s} < \mathfrak{s}_{1/2}$, as well as several results about possible values of $\mathfrak{i}_{1/2}$. - 20 April 2023
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 66 (4) , 1237-1243
Base matrices of various heights
A classical theorem of Balcar, Pelant, and Simon says that there is a base matrix of height ${\mathfrak h}$ , where ${\mathfrak h}$ is the distributivity number of ${\cal P} (\omega ) / {\mathrm {fin}}$ . We show that if the continuum ${\mathfrak c}$ is regular, then there is a base matrix of height ${\mathfrak c}$ , and that there are base matrices of any regular uncountable height $\leq {\mathfrak c}$ in the Cohen and random models. This answers questions of Fischer, Koelbing, and Wohofsky.- 20 April 2023
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 66 (4) , 1237-1243
Base matrices of various heights
A classical theorem of Balcar, Pelant, and Simon says that there is a base matrix of height ${\mathfrak h}$ , where ${\mathfrak h}$ is the distributivity number of ${\cal P} (\omega ) / {\mathrm {fin}}$ . We show that if the continuum ${\mathfrak c}$ is regular, then there is a base matrix of height ${\mathfrak c}$ , and that there are base matrices of any regular uncountable height $\leq {\mathfrak c}$ in the Cohen and random models. This answers questions of Fischer, Koelbing, and Wohofsky.- Open Access
The amalgamated limit and its topological interpretation
This is a survey on the amalgamated limit, a limit construction for complete Boolean algebras in iterated forcing theory, which generalizes both the direct limit and the two-step amalgamation. We focus in particular on examples of the amalgamated limit from the literature and on the topological amalgamated limit for compact Hausdorff spaces.
Open AccessThe amalgamated limit and its topological interpretation
This is a survey on the amalgamated limit, a limit construction for complete Boolean algebras in iterated forcing theory, which generalizes both the direct limit and the two-step amalgamation. We focus in particular on examples of the amalgamated limit from the literature and on the topological amalgamated limit for compact Hausdorff spaces.
- Open Access
Shattered Iterations
We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random" iterations, which we call shattered iterations. As basic tools for such iterations we investigate several concepts that are interesting in their own right. Namely, we discuss correct diagrams, we introduce the amalgamated limit of cBa's, a construction generalizing both the direct limit and the two-step amalgamation of cBa's, we present a detailed account of cBa's carrying finitely additive strictly positive measures, and we prove a general preservation theorem for such cBa's in amalgamated limits. As application, we obtain new consistency results on cardinal invariants in Cichon's diagram. For example, we show the consistency of aleph_1 < cov (meager) < non (meager), thus answering an old question of A. Miller.
Open AccessShattered Iterations
We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random" iterations, which we call shattered iterations. As basic tools for such iterations we investigate several concepts that are interesting in their own right. Namely, we discuss correct diagrams, we introduce the amalgamated limit of cBa's, a construction generalizing both the direct limit and the two-step amalgamation of cBa's, we present a detailed account of cBa's carrying finitely additive strictly positive measures, and we prove a general preservation theorem for such cBa's in amalgamated limits. As application, we obtain new consistency results on cardinal invariants in Cichon's diagram. For example, we show the consistency of aleph_1 < cov (meager) < non (meager), thus answering an old question of A. Miller.
- 18 October 2022
- Published by Elsevier in Topology and its Applications
- Vol. 323
Orderings of ultrafilters on Boolean algebras
- 18 October 2022
- Published by Elsevier in Topology and its Applications
- Vol. 323
Orderings of ultrafilters on Boolean algebras