VFVera Fischer
Vera Fischer
*This is an algorithmically generated author record based on publicly available information.
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
Vera Fischer has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Corey Bacal Switzer
University of Vienna
7 shared publications - David Schrittesser
Institute for Advanced Study in Mathematics, Harbin Institute of Technology, Harbin 150001, China
7 shared publications - Asger Törnquist
Department of Mathematics, University of Copenhagen, Universitetsparken 5, 2100 Copenhagen, Denmark
5 shared publications - Diana Carolina Montoya
Institute of Mathematics University of Vienna Kolingasse 14-16 1090 Wien, Austria
3 shared publications - Diego Alejandro Mejía
Graduate School of System Informatics, Kobe University
3 shared publications - Dániel Tamás Soukup
Institute of Mathematics University of Vienna Kolingasse 14-16 1090 Wien, Austria
3 shared publications
Latest Publications
- Open Access
Strong Projective Witnesses
We show Shelah's original creature forcing from 1984 strongly preserves tight mad families. In particular, answering questions of Fischer and Friedman and Friedman and Zdomskyy, we show the constellation $\aleph_1 = \mathfrak{a} < \mathfrak{s} = \aleph_2$ is consistent with the existence of a $Δ_3^1$ wellorder of the reals and tight mad families of sizes $\aleph_1, \aleph_2$ which are $Π_1^1, Π_2^1$-definable, respectively. Each of these projective definitions is of minimal possible complexity.Open AccessStrong Projective Witnesses
We show Shelah's original creature forcing from 1984 strongly preserves tight mad families. In particular, answering questions of Fischer and Friedman and Friedman and Zdomskyy, we show the constellation $\aleph_1 = \mathfrak{a} < \mathfrak{s} = \aleph_2$ is consistent with the existence of a $Δ_3^1$ wellorder of the reals and tight mad families of sizes $\aleph_1, \aleph_2$ which are $Π_1^1, Π_2^1$-definable, respectively. Each of these projective definitions is of minimal possible complexity. - Open Access
- 5 March 2025
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 176 (6)
Tight cofinitary groups
- 5 March 2025
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 176 (6)
Open AccessTight cofinitary groups
- Open Access
- 3 March 2025
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 176 (6)
Universally Sacks-indestructible combinatorial families of reals
- 3 March 2025
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 176 (6)
Open AccessUniversally Sacks-indestructible combinatorial families of reals
- Open Access
- 10 January 2025
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- p. 1-17
GENERALIZED TOWER SPECTRA
We investigate the tower spectrum in the generalized Baire space, i.e., the set of lengths of towers in $\kappa ^\kappa $ . We show that both small and large tower spectra at all regular cardinals simultaneously are consistent. Furthermore, based on previous work by Bağ, the first author and Friedman, we prove that globally, a small tower spectrum is consistent with an arbitrarily large spectrum of maximal almost disjoint families. Finally, we show that any non-trivial upper bound on the tower spectrum in $\kappa ^\kappa $ is consistent.- 10 January 2025
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- p. 1-17
Open AccessGENERALIZED TOWER SPECTRA
We investigate the tower spectrum in the generalized Baire space, i.e., the set of lengths of towers in $\kappa ^\kappa $ . We show that both small and large tower spectra at all regular cardinals simultaneously are consistent. Furthermore, based on previous work by Bağ, the first author and Friedman, we prove that globally, a small tower spectrum is consistent with an arbitrarily large spectrum of maximal almost disjoint families. Finally, we show that any non-trivial upper bound on the tower spectrum in $\kappa ^\kappa $ is consistent. - 1 January 2025
- Published by Mathematical Institute of the Serbian Academy of Sciences and Arts
- p. 217-259
Realizing arbitrarily large spectra of $\mathfrak a_{\mathrm T}$We improve the state-of-the-art proof techniques for realizing various spectra of $\aT$ in order to realize arbitrarily large spectra. Thus, we make significant progress in addressing a question posed by Brian in his work~\cite{Brian_2021}. As a by-product, we obtain many complete subforcings and an algebraic analysis of the automorphisms of the forcing which adds a witness for the spectrum of $\aT$ of desired size.- 1 January 2025
- Published by Mathematical Institute of the Serbian Academy of Sciences and Arts
- p. 217-259
Realizing arbitrarily large spectra of $\mathfrak a_{\mathrm T}$We improve the state-of-the-art proof techniques for realizing various spectra of $\aT$ in order to realize arbitrarily large spectra. Thus, we make significant progress in addressing a question posed by Brian in his work~\cite{Brian_2021}. As a by-product, we obtain many complete subforcings and an algebraic analysis of the automorphisms of the forcing which adds a witness for the spectrum of $\aT$ of desired size.- 1 January 2025
- Published by Institute of Mathematics, Polish Academy of Sciences in Fundamenta Mathematicae
- Vol. 269 (1) , 45-69
Partitions of the Baire space into compact sets
We define a c.c.c. forcing which adds a maximal almost disjoint family of finitely splitting trees on $\omega $ (a.d.f.s. family) or equivalently a partition of the Baire space into compact sets of desired size. Further, we utilize this forcing to ad- 1 January 2025
- Published by Institute of Mathematics, Polish Academy of Sciences in Fundamenta Mathematicae
- Vol. 269 (1) , 45-69
Partitions of the Baire space into compact sets
We define a c.c.c. forcing which adds a maximal almost disjoint family of finitely splitting trees on $\omega $ (a.d.f.s. family) or equivalently a partition of the Baire space into compact sets of desired size. Further, we utilize this forcing to ad- Open Access
- 24 April 2024
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 262 (1) , 191-234
Refining systems of mad families
We construct a model in which there exists a refining matrix of regular height λ larger than $$\mathfrak{h}$$ ; both $$\lambda = \mathfrak{c}$$ and $$\lambda < \mathfrak{c}$$ are possible. A refining matrix is a refining system of mad families without common refinement. Of particular interest in our proof is the preservation of $${\cal B}$$ -Canjarness.- 24 April 2024
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 262 (1) , 191-234
Open AccessRefining systems of mad families
We construct a model in which there exists a refining matrix of regular height λ larger than $$\mathfrak{h}$$ ; both $$\lambda = \mathfrak{c}$$ and $$\lambda < \mathfrak{c}$$ are possible. A refining matrix is a refining system of mad families without common refinement. Of particular interest in our proof is the preservation of $${\cal B}$$ -Canjarness. - Open AccessRealizing arbitrarily large spectra of $\mathfrak{a}_{\text{T}}$We improve the state-of-the-art proof techniques for realizing various spectra of $\mathfrak{a}_{\text{T}}$ in order to realize arbitrarily large spectra. Thus, we make significant progress in addressing a question posed by Brian in his recent work. As a by-product, we obtain many complete subforcings and an algebraic analysis of the automorphisms of the forcing which adds a witness for the spectrum of $\mathfrak{a}_{\text{T}}$ of desired size.Open AccessRealizing arbitrarily large spectra of $\mathfrak{a}_{\text{T}}$We improve the state-of-the-art proof techniques for realizing various spectra of $\mathfrak{a}_{\text{T}}$ in order to realize arbitrarily large spectra. Thus, we make significant progress in addressing a question posed by Brian in his recent work. As a by-product, we obtain many complete subforcings and an algebraic analysis of the automorphisms of the forcing which adds a witness for the spectrum of $\mathfrak{a}_{\text{T}}$ of desired size.
- Open Access
Universally Sacks-indestructible combinatorial families of reals
We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other similar types of families commonly studied in combinatorial set theory. We then prove that every combinatorial family of reals of arithmetical type, which is indestructible by the product of Sacks forcing $\mathbb{S}^{\aleph_0}$, is in fact universally Sacks-indestructible, i.e. it is indestructible by any countably supported iteration or product of Sacks-forcing of any length. Further, under $\text{CH}$ we present a unified construction of universally Sacks-indestructible families for various arithmetical types of families. In particular we prove the existence of a universally Sacks-indestructible maximal cofinitary group under $\text{CH}$.Open AccessUniversally Sacks-indestructible combinatorial families of reals
We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other similar types of families commonly studied in combinatorial set theory. We then prove that every combinatorial family of reals of arithmetical type, which is indestructible by the product of Sacks forcing $\mathbb{S}^{\aleph_0}$, is in fact universally Sacks-indestructible, i.e. it is indestructible by any countably supported iteration or product of Sacks-forcing of any length. Further, under $\text{CH}$ we present a unified construction of universally Sacks-indestructible families for various arithmetical types of families. In particular we prove the existence of a universally Sacks-indestructible maximal cofinitary group under $\text{CH}$. - Open Access
Generic Selective Independent Families
We prove that the generic maximal independent family obtained by iteratively forcing with the Mathias forcing relative to diagonalization filters is densely maximal. Moreover, by choosing the filters with some care one can ensure the family is selective and hence forcing indestructible in a strong sense. Using this we prove that under $\mathfrak{p} = 2^{\aleph_0}$ there are selective independent families and also we show how to add selective independent families of any desired size.Open AccessGeneric Selective Independent Families
We prove that the generic maximal independent family obtained by iteratively forcing with the Mathias forcing relative to diagonalization filters is densely maximal. Moreover, by choosing the filters with some care one can ensure the family is selective and hence forcing indestructible in a strong sense. Using this we prove that under $\mathfrak{p} = 2^{\aleph_0}$ there are selective independent families and also we show how to add selective independent families of any desired size.